The elliptic curve discrete logarithm problem (ECDLP) lies at the heart of modern public-key cryptography. It concerns the challenge of determining an unknown scalar multiplier given two points on ...

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. Advances in Cryptology – EUROCRYPT 2014, Lecture Notes in Computer Science, Volume 8441 ...

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...

Explore the Diffie-Hellman Key Exchange, one of the earliest practical implementations of secure key exchange in the field of ...

The new records include the factoring of RSA-240, an RSA key that has 240 decimal digits and a size of 795 bits. The same team of researchers also computed a discrete logarithm of the same size.

He adds that the issues are very similar for the discrete log problem. Computers are indeed getting faster all the time, and networks are becoming more prevalent and faster.

“The discrete logarithm computation for our backdoored prime was only feasible because of the 1024-bit size, and the most effective protection against any backdoor of this type has always been ...

Solving a key's discrete logarithm problem is significant in the Diffie-Hellman arena. Why? Because a handful of primes are frequently standardized and used by a large number of applications.

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., GF (p2), GF (p12)) are the Number Field Sieve and ...