Judul: Analisis dan Implementasi Algoritme Advanced Encryption Standard (AES) Secara Paralel
Abstrak: AES is an algorithm for symmetric key cryptography. AES is expected to replace Data Encryption Standard (DES) as a recognized standard for various applications. The complexity of AES encryption and decryption process is O(n), it has fast computation in both encryption and decryption but its execution time will increase as the input data increase. In this research the AES algorithm would be parallelized by dividing the data to each processor (domain decomposition) and by dividing the constituent computing of AES to each processor (functional decomposition), and their performance would be analyzed. Parallel implementation of AES algorithm uses Message Passing Interface (MPI). The objectives of this research are to measure and analyze the performance of parallel AES algorithm using performance metrics. The best result of the parallel AES algorithm in this research is in the decryption process using domain decomposition method. A file with 118.525 MB size has 127.227 seconds decryption execution time using sequential AES algorithm, whereas using 16 processors, its decryption execution time is 34.896 seconds. The speedup is 3.646 and the efficiency is 0.228. This result is not good enough because the speedup is not equal to the number of processors used and the efficiency is below one. This is because the AES decryption in this research has a fast computational process, yet it has a big overhead for data communication. The worst result of the parallel AES algorithm is in the decryption process using functional decomposition method. Using the same file and three processors, the decryption execution time is 168.089 seconds. The speedup is 0.755 and the efficiency is 0.252. This is due to the fact that computing process decomposition is not equally distributed among the processes and the use of MPI blocking communication routine which cause a big overhead for data communication. Both parallel algorithms used in this research are not cost-optimal
Keyword: 

Judul: Analisis dan implementasi algoritme 3 DES secara paralel
Abstrak: One of the data encryption algorithm known since 1977 is Data Encryption Standard (DES). One of the DES algorithm variants since 1999 is 3DES algorithm. In 3DES, DES algorithm is used three times for encryption and decryption process with different key for each test. The encryption and decryption computational time for DES main algorithm grows proportionally with the increasing size of input block plaintext and ciphertext. In this research, parallel processing is applied by dividing the data to several processes, so that the encryption and decryption process against blocks of data run in parallel. The Message Passing Interface is used for presenting parallelization of 3DES algorithm. The objectives of this research is to implement and analyze the complexity and the perfomance of 3DES algorithm both serially and parallelly. The mode of operation used for running 3DES algorithms is Electronic CodeBook (ECB). The analysis performed in this research includes the analysis of performance metrics and the experimental results of the 3DES algorithm both serially and parallelly. The results of this research are summarized as follows: 1. The execution of serial 3DES algorithm for encryption and decryption for files with greater sizes give longer time. For example, a file size of 4,009,016 bytes takes the encryption or decryption computational times about 957.87 seconds or 15.97 in minutes. 2. Parallelization of 3DES algorithm in the Electronic CodeBook mode performed in domain decomposition, that is input blocks are distributed to some processes that will work in parallel. However, the code containing I/O function is unparallelizable, because the access to memory is, by its very nature, sequential. 3. The speedup of 3DES parallel program grows proportionally with the increasing size of files until a certain limit. 4. To obtain a fixed value of efficiency in 3DES parallel programs, the size of the input block in this case (n) should be increased by 2p2 + p log2 p fold. The maximum efficiency value from 3DES parallel programs is absolutely one.
Keyword: block cipher, cryptography, Data Encryption Standard (DES), 3DES, Electronic CodeBook (ECB), parallel, Message Passing Interface (MPI)

Judul: Etno-ornitologi Burung Kancilan Flores (Pachycephala nudigula nudigula Hartert 1897) pada Masyarakat Lio di Taman Nasional Kelimutu
Abstrak: Bare-throathed whistler is one of several wild birds in Kelimutu National Park (TNKL) that is believed to have correlation with Lio Community‟s belief. The estimation of Bare-throated whistler‟s population in Kelimutu National Park was about 186.41-1668.07 individual by the density about 0.0389-0.3481 ind/ha with the sex ratio 6.2:1 that spreaded on area with height of 1100 – 1600 masl. The characteristic of Bare-throated whistler‟s habitat is a natural forest with various canopy level, high plant species diversity and high density. The habitat characteristics related to the availability of food in the form of insects, cover, safety and a nesting site. Generally the most of Lio community knew the existence of Bare-throated whistler directly or from their parents‟ stories. The perceptions of Lio Community to the Bare-throated whistler‟s existence is generally support the conservation efforts. The perceptions construct the Lio Community‟s atitude that tend to be conservative to the existence of Bare-throated whistler. The attitude shown by their behavior that not cathing the Bare-throated whistler from the TNKL‟s area or the outside. The attitude have an important role to the existence of Bare-throated whistler in Kelimutu National Park‟s area.
Keyword: