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.

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

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  P. L. Montgomery,et al.  A survey of modern integer factorization algorithms , 1994 .

[4]  Youngseok Lee,et al.  New strategy for optimizing wavelength converter placement. , 2005, Optics express.

[5]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[6]  Kusum Deep,et al.  A new crossover operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

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

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

[9]  K. V. Price,et al.  Differential evolution: a fast and simple numerical optimizer , 1996, Proceedings of North American Fuzzy Information Processing.

[10]  Michael N. Vrahatis,et al.  Particle swarm optimization for integer programming , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  Andries Petrus Engelbrecht,et al.  Binary Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[12]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

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

[15]  Benne de Weger,et al.  Cryptanalysis of RSA with Small Prime Difference , 2002, Applicable Algebra in Engineering, Communication and Computing.

[16]  M. Hinek.  Cryptanalysis of RSA and Its Variants , 2009 .

[17]  Singiresu S. Rao.  Engineering Optimization : Theory and Practice , 2010 .

[18]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[19]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[20]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[21]  D. Williamson,et al.  The box plot: a simple visual method to interpret data. , 1989, Annals of internal medicine.