Article

Article title DEVELOPMENT OF GENETIC MODEL OF SEARCH OF PRIME NUMBERS FOR CRYPTOANALYSIS OF RSA BY CLIENT-SERVER STRUCTURE
Authors H.А. Kazharov
Section SECTION I. EVOLUTIONARY MODELING, GENETIC AND BIONIC ALGORITHMS
Month, Year 09, 2008 @en
Index UDC 681.3.06
DOI
Abstract The analysis of cryptosystem RSA and different approaches to cryptoanalysis are investigated in this work. The main idea of proposed method is based on factorization of composite number into two prime numbers with the help of methods of genetic search. The block diagram of genetic algorithm for parallel cryptoanalysis of RSA was developed. The method of creation of initial population, in which the algorithm of fast primality check was developed, was identified. The objective function, which enables to determine adaptability of certain species of population, was developed. The method of selection of parental pair of chromosome in genetic algorithm was identified. The modified crossingover operator, taking into consideration specific character of task, was developed. The scheme of genetic search based on client-server structure is described in this work.

Download PDF

Keywords cryptosystem, RSA, factorization of composite number, genetic algorithm, prime numbers.
References 1. Ященко В.В. Введение в криптографию. – М.: МЦНМО, 2003.
2. Баричев С., Криптография без секретов [Электронный ресурс] – http://forum.armkb.com.
3. Василенко O.Н. Теоретико-числовые алгоритмы в криптографии. – М.: МЦНМО, 2003.
4. МакКоннелл Дж. Основы современных алгоритмов. – М.: Техносфера, 2004.
5. Гладков Л.А., Курейчик В.М., Курейчик В.В. Генетические алгоритмы. – Ростов-на-Дону: ООО «Ростиздат», 2004.

Comments are closed.