Application of bio-inspired algorithm to the problem of integer factorization

International Journal of Bio-Inspired Computation

Volumn 2, Issue 2, 2010, Pages 115-123

  Yampolskiy, Roman V ^a  

^a University of Louisville   (United States)

Author keywords

Evolutionary algorithm; Genetic algorithm; Global maxima; Integer factorisation

Indexed keywords

BIOMIMETICS; EVOLUTIONARY ALGORITHMS; FACTORIZATION; PUBLIC KEY CRYPTOGRAPHY;

BIO-INSPIRED ALGORITHMS; GLOBAL MAXIMUM; INTEGER FACTORIZATION; LOCAL MAXIMUM; NON-TRIVIAL; STATISTICAL DISTRIBUTION;

GENETIC ALGORITHMS;

EID: 80051631854     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2010.032127     Document Type: Review

References (32)

1. Lenstra, A.K. and Lenstra, H.W. Jr (Ed.) (1993) The Development of the Number Field Sieve, Springer-Verlag, New York.
2. Adi Shamir, E.T. (2003)'Factoring large numbers with the TWIRL device', Crypto - The 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, pp.1-26.
3. Brent, R.P. (1999)'Factorization of the tenth Fermat number', Mathematics of Computation, Vol. 68, pp.429-451.
4. Brent, R.P. (2000)'Recent progress and prospects for integer factorisation algorithms', Computing and Combinatorics: Sixth Annual International Computing and Combinatorics Conference, Sydney, Australia, pp.3-22.
5. Bressoud, D.M. (1989) Factorizations and Primality Testing, Springer-Verlag, New York.
6. Chan, D.M. (2002)'Automatic generation of prime factorization algorithms using genetic programming', in Genetic Algorithms and Genetic Programming at Stanford. pp.52-57. Stanford Bookstore. Stanford, California.
7. Chang, W-L., Guo, M. and Ho, M.S-H. (2005)'Fast parallel molecular algorithms for DNA-based computation: factoring integers', IEEE Transactions on Nanobioscience, Vol. 4.
8. Dixon, J.D. (1981)'Asymptotically fast factorization of integers', Math. Comput., Vol. 36, pp.255-260.
9. Elkenbracht-Huizing, R-M. (1997)'Factoring integers with the number field sieve', PhD Thesis, Leiden University.
10. Finkel, J.R. (2003)'Using genetic programming to evolve an algorithm for factoring numbers', in Koza, J.R. (Ed.): Genetic Algorithms and Genetic Programming at Stanford, Stanford Bookstore, Stanford, California.
11. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Pub. Co.
12. Jansen, B. and Nakayama, K. (2005)'Neural networks following a binary approach applied to the integer prime-factorization problem', IEEE International Joint Conference on Neural Networks (IJCNN), 31 July, pp.2577-2582. (Pubitemid 44591603)
13. Knuth, D.E. (1981) The Art of Computer Programming, Addison-Wesley.
14. Laskari, E.C., Meletiou, G.C., Tasoulis, D.K. and Vrahatis, M.N. (2006)'Studying the performance of artificial neural networks on problems related to cryptography', Nonlinear Analysis: Real World Applications, Vol. 7, pp.937-942. (Pubitemid 43903697)
15. Lehmer, D.H. and Powers, R.E. (1931)'On factoring large numbers', Bulletin of the American Mathematical Society, Vol. 37, pp.770-776.
16. Lenstra, A.K. and Verheul, E.R. (2001)'Selecting cryptographic key sizes', Journal of Cryptology, Vol. 14, pp.255-293. (Pubitemid 33770276)
17. Lenstra, H.W. (1987)'Factoring integers with elliptic curves', Annals of Mathematics, Vol. 2, pp.649-673.
18. Marain, F. (2002)'Thirty years of integer factorization', in F. Shyzak (Ed.): Algorithms Seminar 2000-2001, INRIA, pp.77-80.
19. Maurer, U. and Rueppel, R. (Eds.) (1992) Factoring with an Oracle, Springer-Verlag.
20. McKee, J. (1996)'Turning Euler's factoring method into a factoring algorithm', Bulletin of the London Mathematical Society, Vol. 4, pp.351-355.
21. McKee, J. (1999)'Speeding Fermat's factoring method', Mathematics of Computation, Vol. 68, pp.1729-1737.
22. Meletiou, G., Tasoulis, D.K. and Vrahatis, M.N. (2002)'A first study of the neural network approach to the RSA cryptosystem', IASTED 2002 Conference on Artificial Intelligence, Banff, Canada, pp.483-488.
23. Nowostawski, M. and Poli, R. (1999)'Parallel genetic algorithm taxonomy', Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, Adelaide, SA, Australia, pp.88-92. (Pubitemid 30525189)
24. Pollard, J.M. (1974)'Theorems of factorization and primality testing', Proceedings of the Cambridge Philosophical Society, Vol. 76, pp.521-528.
25. Pollard, J.M. (1975)'A Monte Carlo method for factorization', BIT Numerical Mathematics, Vol. 15, pp.331-334.
26. Pomerance, C. (1996)'A tale of two sieves', Notices of the AMS, Vol. 43, pp.1473-1485.
27. Rivest, R.L. and Shamir, A. (1986)'Efficient factoring based on partial information', Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology-EUROCRYPT'85, Springer-Verlag, Linz, Austria, pp.31-34.
28. RSA (2009)'RSA numbers', Wikipedia, The Free Encyclopedia, 5 February, available at http://en.wikipedia.org/wiki/RSA-numbers.
29. Shamir, A. (1999)'Factoring large numbers with the TWINKLE device (extended abstract)', Workshop on Cryptographic Hardware and Embedded Systems (CHES'99), Worcester, Massachusetts, USA, pp.2-12.
30. Shor, P.W. (1997)'Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer', SIAM Journal Sci. Statist. Computing, Vol. 26, pp.1484-1509. (Pubitemid 127613100)
31. Williams, H.C. (1982)'A p + 1 method of factoring', Math. Comp., Vol. 39, pp.225-234.
32. Yampolskiy, R., Anderson, P., Arney, J., Misic, V. and Clarke, T. (2004)'Printer model integrating genetic algorithm for improvement of halftone patterns', Western New York Image Processing Workshop (WNYIPW), IEEE Signal Processing Society, Rochester, NY.