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

Oliver Schirokauer, Discrete Logarithms and Local Units, Philosophical Transactions: Physical Sciences and Engineering, Vol. 345, No. 1676, Theory and Applications of Numbers without Large Prime ...

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

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

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

The discrete logarithm problem involves modular arithmetic (numbers wrap around, as in a clock, where hours run from 0 to 11 and back to 0 again – this is written as “mod 12”). Given three very large ...

New crypto-cracking record reached, with less help than usual from Moore’s Law 795-bit factoring and discrete logarithms achieved using more efficient algorithms.