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 an ...

According to Jeff Dean (@JeffDean), 17-year-old Enrique Barschkis (@ebarschkis) solved a significant mathematical problem related to the elliptic curve discrete logarithm problem (DLP) with ...

Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic ...

Abstract: The security of modern cryptographic systems often relies on the hardness of the Discrete Logarithm Problem (DLP), particularly through its application in the Diffie-Hellman key exchange ...

An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers ...

Researchers have reached a new milestone in the annals of cryptography with the factoring of the largest RSA key size ever computed and a matching computation of the largest-ever integer discrete ...

Add a description, image, and links to the discrete-logarithm-problem topic page so that developers can more easily learn about it.