Meta heuristics for prime factorization problem

摘要

Generally, cryptographic algorithms are based on NP-Complete problems like prime factorization, discrete logarithm etc. The difficulties of RSA and Rabin cryptographic algorithms are based on prime factorization problem. Prime factorization problem may be modeled as a Non-uniform discrete optimization problem. In this paper some meta heuristic techniques namely, Genetic algorithm, Differential Evolution and Particle Swarm Optimization are explored for the solution of this problem. The reported results show that it is very challenging to solve this non-uniform optimization problem through meta heuristic techniques.