Efficient factoring based on partial information
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Factorization of the tenth Fermat number
Mathematics of Computation
Speeding Fermat's factoring method
Mathematics of Computation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Wisdom of artificial crowds algorithm for solving NP-hard problems
International Journal of Bio-Inspired Computation
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
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.