In this paper, the intractable problem of finding the prime factors of an integer has been represented as the integer programming problem to be solved using nature inspired heuristics. Integer factorization is a one-way mathematical function and because of its computational intractability, it is frequently used in public key cryptography, for example in RSA encryption systems. Since integer factorization can be represented in the form of a discrete optimization task, more specifically as integer programming problem, various optimization tools can be utilized for cryptanalysis. In this contribution, we approach this problem using a heuristic algorithm designed with concepts derived from computational chemistry that involves energy minimization of a molecular geometry of a crystal. We observe that computational chemistry can provide a great insight into such problems of unknown dynamics. Future work remains to optimize the algorithm for scalability.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.