A Modified Chaotic Firefly Algorithm for Solving Discrete Logarithm Problem and Analysis

In this paper, we present a modified version of firefly algorithm that shows considerable potential in solving discrete logarithm problem, a mathematical function used in public-key cryptography like Diffie-Hellman Key Exchange and El Gamal Encryption. Firefly Algorithm has been experimentally proved to have outperformed a number of metaheuristics like the popular Particle Swarm Optimization. While solving the problem of finding discrete logarithm, we also evaluate the effectiveness of the algorithm and its modified version in solving such cryptographic problems. Observations show significant potential of Firefly Algorithm in solving small instances of the problem, while it calls for further research in scaling up the effectiveness of the algorithm in solving bigger instances of the problem. Simultaneously, we also analyze the convergence of the modified algorithm.

[1]  C. Cobeli,et al.  ON THE DISCRETE LOGARITHM PROBLEM , 2008, 0811.4182.

[2]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[3]  Kaushal K. Shukla,et al.  A Study on the Limitations of Evolutionary Computation and other Bio-inspired Approaches for Integer Factorization , 2015, SCSE.

[4]  G. Nemhauser,et al.  Integer Programming , 2020 .

[5]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[6]  Matjaz Perc,et al.  A review of chaos-based firefly algorithms: Perspectives and research challenges , 2015, Appl. Math. Comput..

[7]  René Schoof,et al.  The Discrete Logarithm Problem , 2016, Open Problems in Mathematics.

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[10]  Leandro dos Santos Coelho,et al.  A chaotic firefly algorithm applied to reliability-redundancy optimization , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[11]  Robert L. Devaney,et al.  Practical Numerical Algorithms for Chaotic Systems (T. S. Parker and L. O. Chua) , 1990, SIAM Rev..

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

[13]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[14]  Jung Hee Cheon,et al.  Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.

[15]  M. N. Vrahatis,et al.  The Discrete Logarithm Problem as an Optimization Task : A First Study , 2003 .

[16]  Oded Galor,et al.  Discrete Dynamical Systems , 2005 .

[17]  Leon O. Chua,et al.  Practical Numerical Algorithms for Chaotic Systems , 1989 .

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

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

[20]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

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

[22]  M.I. Aziz,et al.  Introduction to Cryptography , 2002, 2005 International Conference on Microelectronics.

[23]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[24]  Andrew M. Odlyzko,et al.  Discrete Logarithms: The Past and the Future , 2000, Des. Codes Cryptogr..

[25]  M. N. Vrahatisa,et al.  Studying the performance of artificial neural networks on problems related to cryptography , 2005 .

[26]  D. Shanks.  Class number, a theory of factorization, and genera , 1971 .

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

[28]  Helmut Hasse.  The Class Number , 1980 .

[29]  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..

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

[31]  Leonard M. Adleman,et al.  A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[32]  B. Kendall.  Nonlinear Dynamics and Chaos , 2001 .

[33]  J. Pollard,et al.  Monte Carlo methods for index computation () , 1978 .

[34]  Leonard M. Adleman,et al.  Function Field Sieve Method for Discrete Logarithms over Finite Fields , 1999, Inf. Comput..