Authors: Roman V. Yampolskiy
Addresses: Speed School of Engineering, Computer Engineering and Computer Science, University of Louisville, Louisville, KY 40292, USA
Abstract: This paper describes an attempt at developing an evolutionary algorithm capable of solving non-trivial cases of integer factorisation, which are at the heart of security behind the modern public key cryptography systems. After reviewing previous work in integer factorisation and describing the developed genetic algorithm the paper addresses issues of convergence to a local maxima associated with the performance of genetic algorithms. Specifically, properties and statistical distribution of local maxima points associated with the integer factorisation problems are reviewed. Finally, performance of the developed system is analysed and recommendations are made for future research paths.
Keywords: evolutionary algorithms; integer factorisation; global maxima; genetic algorithms; bio-inspired computation; public key cryptography; security.
International Journal of Bio-Inspired Computation, 2010 Vol.2 No.2, pp.115 - 123
Available online: 10 Mar 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article