Generating Prim Numbers Using Genetic Algorithms

Genetski algoritmi su poznata i često korištena heuristička metoda za rješavanje optimizacijskih problema. Tema rada je primjena genetskih algoritama na generiranje velikih prostih brojeva koji imaju poseban značaj u kriptografiji. Dan je uvod u te- oriju prostih brojeva te metode koje se koriste za provjeru prostosti nekoga (velikog) broja. Prikazana je implementacija genetskog algoritma za generiranje prostih brojeva uz prikladan prikaz rješenja i genetske operatore. Rezultati su analizirani i prikazani grafički za različite parametre genetskog algoritma. Genetic algorithms are a well-known and frequently used heuristic method for sol- ving optimization problems. The theme of the paper is the application of genetic al- gorithms for generating large prime numbers that have special significance in crypto- graphy. An introduction to the theory of prime numbers and the methods used to check the primality of a large number are shown. The implementation of a genetic algorithm for generating prime numbers is presented with a convenient representation and gene- tic operators. The results were analyzed and graphically presented for different genetic algorithm parameters.