गेनेराटर बिलंगन prima

PRIMES GENERATOR USING BIT-ARRAY STRUCTURE

GENERATOR BILANGAN PRIMA
DENGAN MENGGUNAKAN STRUKTUR BIT-ARRAY


Oleh :
Imat Rakhmat Hidayat 1), A.Rida Ismu Windyarto2),
Samiadji Herdjunanto3)
1) Mahasiswa S-2, Jurusan Teknik Elektro, Fakultas Teknik Universitas Gadjah Mada Yogyakarta
2) Jurusan Teknik Elektro, Fakultas Teknik Universitas Gadjah Mada Yogyakarta
3) Jurusan Teknik Elektro, Fakultas Teknik Universitas Gadjah Mada Yogyakarta

Abstract

The use of prime numbers is a serious problem in the development of computer science and number theory, so it is deemed necessary to create a tool that can generate a sequence of regular primes.
Prime number generator is a tool, which can generate the sequence patterns of regular prime numbers, bit-array structure is a grouping method of variables that contain data sets with each data element of the same type used in the storage of generated sequence numbers.
Prime numbers is very useful to be applied as the basis of the creation of public-key cryptography algorithm, the hash table, hash table algorithm is best used when initialized with a prime number in order to minimize collisions (collisions) is going to happen, in determining the sequence patterns of prime numbers a very large size is not an easy job, so this becomes a problem to be solved. Thus it is necessary how the fastest way to generate a sequence of prime numbers is very large in size.
Use search within the processor serial sequence of prime numbers is very large in size or less efficient given the need for computing time long enough, so by using bit-array structure is expected difficulties in the search for sequence patterns of prime numbers can be solved even without using multiple processors though, and can also minimize the complexity of access time.


Key Word : Prime Number, Bit-Array, One Processor, Computation.