Judul: Analysis of Quadratic Sieve Algorithm with Parallel Implementation
Abstrak: Algorithm for finding the prime factors of large composite numbers are importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factorization problem. This research uses quadratic sieve algorithm for factoring big composite numbers. Quadratic sieve is the best algorithm for factoring composite numbers bellow 100 decimal digits. The quadratic sieve is analyzed and implemented using C programming language and parallelized by functional decomposition and domain decomposition. This research uses additional libraries for parallel implementation and for computing big integer numbers, which are MPI and GMP. The implementation result is tested in a computer with four processors. The factorized composite numbers are 25, 30, and 35 digits. The objectives of this research is to measure and analyze the performance of parallel quadratic sieve algorithm using performance metrics and the complexity of the implemented quadratic sieve. This research uses two ways for parallelizing method: functional decomposition toward sieving stage and domain decomposition on sieving stage. The best result of parallel quadratic sieve is the domain decomposition on sieving stage which has an average efficiency of 91.6%. The result is not good enough because there are an additional task for changing GMP data type to MPI data type on parallel implementation. The complexity of the communication is e^((ln N ln ln N)^(1/2) 10log N + 4 (P-1))/B which means it becomes worse the higher the composite numbers are. Performance metrics also become worse because of the additional task and the communication.
Keyword: 

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: Ornithonyssus Bursa (Berlese, 1888) Famili Macronyssidae yang Menyerang Unggas Dan Penaggulangannnya
Abstrak: Ornithonyssus bursa adalah tungau penghisap darah pada unggas di daerah tropis dan subtropis. Tungau ini relatif kecil, dengan panjang tubuh antara 700-1000 mikron dan lebarnya 250-490 mikron. Tubuhnya bulat berwarna coklat kekuningan sebelum menghisap darh dan berwarna merah setelah menghisap darah dari induk semangnya.
Keyword: