Heuristic algorithm based on molecules optimizing their geometry in a crystal to solve the problem of integer factorization

Integer factorization is a vital number theoretic problem finding frequent use in public key cryptography, and other areas like Fourier transforms. There has been growing interest among researchers in innovative alternative approaches to solving the problem by modeling some optimizing natural or biological behaviour in a form of an algorithm that can be used to solve the problem provided the problem can be represented as an optimization task. In this paper, we present a new model based on computational chemistry behind how molecules interact among each other to minimize their surface energy potential in a typical crystal. While this phenomenon itself is a research problem, it interestingly provides a new way of solving other problems like integer factorization which can be represented in different forms of discrete optimization task. However, we must note that the present methods based on such models are not scalable to the real-world scenario, and we present a brief discussion on this issue.

[1]  Harish Sharma,et al.  Meta heuristics for prime factorization problem , 2013, 2013 World Congress on Nature and Biologically Inspired Computing.

[2]  David Michael Chan.  Automatic Generation of Prime Factorization Algorithms Using Genetic Programming , 2002 .

[3]  R. Brent.  "Recent progress and prospects for integer factorisation algorithms," Computing and Combinatorics : 6th Annual International Conference, COCOON 2000 , 2000 .

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Adi Shamir,et al.  Factoring Large Number with the TWIRL Device , 2003, CRYPTO.

[6]  Saibal K. Pal,et al.  A Multithreaded Bound Varying Chaotic Firefly Algorithm for prime factorization , 2014, 2014 IEEE International Advance Computing Conference (IACC).

[7]  Arjen K. Lenstra,et al.  Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.

[8]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[9]  Robert M. May,et al.  Simple mathematical models with very complicated dynamics , 1976, Nature.

[10]  Michael N. Vrahatis,et al.  A FIRST STUDY OF THE NEURAL NETWORK APPROACH IN THE RSA CRYPTOSYSTEM , 2002 .

[11]  K. Nakayama,et al.  Neural networks following a binary approach applied to the integer prime-factorization problem , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[12]  Robert J. Marks,et al.  Conservation of Information in Search: Measuring the Cost of Success , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[13]  Elaine Rich,et al.  Automata, Computability and Complexity: Theory and Applications , 2007 .

[14]  Dimitris K. Tasoulis,et al.  Studying the performance of artificial neural networks on problems related to cryptography , 2006 .

[15]  M. N. Vrahatis,et al.  Problems of cryptography as discrete optimization tasks , 2005 .

[16]  Bui An Ton.  An optimal control free boundary problem for the Navier–Stokes equations , 2005 .

[17]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[18]  Carl Pomerance,et al.  A Tale of Two Sieves , 1998 .

[19]  Roman V. Yampolskiy.  Application of bio-inspired algorithm to the problem of integer factorisation , 2010, Int. J. Bio Inspired Comput..

[20]  M. N. Vrahatisa,et al.  Problems of cryptography as discrete optimization tasks , 2005 .

[21]  Mihir Bellare,et al.  Lecture Notes on Cryptography , 2001 .

[22]  Richard P. Brent,et al.  Recent Progress and Prospects for Integer Factorisation Algorithms , 2000, COCOON.

[23]  Arjen K. Lenstra,et al.  Selecting Cryptographic Key Sizes , 2000, Public Key Cryptography.