THE DISCRETE LOGARITHM PROBLEM AS AN OPTIMIZATION TASK: A FIRST STUDY

摘要

Most of the contemporary cryptographic systems are based on mathematical problems whose solutions are generally intractable in polynomial time; such problems are the discrete logarithm problem and the integer factorization problem. In this contribution we consider the discrete logarithm problem as an Integer Programming Problem. Two Evolutionary Computation methods, namely the Particle Swarm Optimization and the Differential Evolution algorithm, as well as the Random Search technique, are employed as a first approach to tackle this new Integer Programming Problem. Primitive results indicate that this new approach seems promising.