Judul: Pembangkitan Bilangan Prima dengan Metode Saringan Eratosthenes
Abstrak: Cryptograph is required in securing information or data transmission. In cryptograph, prime numbers are required in high level message security. These prime numbers are acquired by generation method. There are many considerable methods which can be implemented to find prime numbers, one of them is the sieve of Eratosthenes method. There is another method to generate prime numbers, which is called Miller-Rabin prime test algorithm. The aims of this paper are to study and implement the sieve of Eratosthenes method and Miller-Rabin prime test algorithm, and then to compare these algorithms. The sieve of Eratosthenes method is applied to find all prime numbers up to a specified integer n. The filtering is acquired by determining all prime numbers which are smaller or equal to L J;, J and cancelling all integers which are multiple of these prime numbers. In Miller-Rabin prime test algorithm all prime numbers in one interval is determined by applying a certain test to each number within this interval. According to the implementation results, time requirement to execute the sieve Eratosthenes algorithm is shorter than the Miller-Rabin prime test algorithm. The sieve Eratosthenes algorithm needs o( n(lgn)2Ig Ign) bit operations, while generation of prime numbers using Miller-Rabin prime test algorithm needs O({10gnf) bit operations. Nevertheless, the memory requirement of sieve Eratosthenes is higher than Miller-Rabin prime test algorithm. It is because the sieve Eratosthenes algorithm consumes n array and memory consumption of the Miller-Rabin prime test algorithm is negligible (constant).
Keyword: 

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: Performa Ayam Kampung yang Divaksinasi Tetelo di Desa Karacak
Abstrak: Ayam Kampung nlemp~lnyai daya adaptasi yang cukup baik untuk bisa hidup di lingkungan pedesaan maupun perkotaan. Ayam lokal ini tidak tnungkin dapat dipisahkan dari kehidupan masyarakat karena cukup berperan sebagai tabungan dan pemenuhan gizi keluarga. Produktivitas yang lambat dan tingkat kematian akibat penyakit merupakan kendala yang sering dihadapi dalam pengemballgall ayam Kampulig di pedesaan.
Keyword: