Judul: Analisis dan implementasi algoritme RSA secara paralel
Abstrak: RSA is an algorithm for public key cryptography. The advantage of RSA is it is difficult to be attacked. Besides that, RSA has shortcomings. For example, execution time of RSA algorithm is longer than other algorithms like DES and RC6. In this research the RSA algorithm would be parallelized by dividing the data to each processor and the performance of the RSA algorithm would be analyzed. Parallel implementation of the RSA algorithm uses Message Passing Interface (MPI).The objectives of this research is to measure and analyze the performance of parallel RSA algorithm using performance metrics. This research uses eight processors with Windows XP SP 2 as operating system. This research uses ASCII text and binary files for the experiment. The result of this research indicates that the RSA algorithm is good when it is parallelized using domain decomposition method because the RSA algorithm has a long computational process, but it has fast communication time. The best result of parallel RSA algorithm in this research is in decryption process. For example, for file size of 4.204.979 bytes, decryption execution time of sequential RSA algorithm is 4207.286 seconds, whereas using the eight process, respectively is 530.762 seconds. The speedup is 7.929 and the efficiency is 0.991. This result is good because ideally speedup is equal to the number of processors used and optimum efficiency is one. The worst result of parallel RSA algorithm is in encryption process with small file sizes. For example, for file size of 116.820 bytes, encryption execution time of sequential RSA algorithm is 0.292 seconds, whereas using the eight process, respectively is 0.066 seconds. The speedup is 4.419 and the efficiency is 0.567. This is because the RSA encryption in this research has a fast computational process, but it also has big overhead for data communication.
Keyword: RSA algorithm, Parallel, Message Passing Interface(MPI), Peformance metrics, Bogor Agricultural University, Institut Pertanian Bogor, IPB

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: 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: