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

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

In this article, we examine how the index calculus approach for computing discrete logarithms in small genus hyperelliptic curves can be improved by introducing a double large prime variation. Two ...

Researchers warn that many 1024-bit keys used to secure communications on the internet today might be based on prime numbers that have been intentionally backdoored in an undetectable way. Many public ...

I study the speed with which finite Markov chains approach their stationary distribution. Recent work has focused on the analysis of two early birthday attacks on problems related to cryptography: ...

Editor's note: See the original article on PurpleAlientPlanet. Some of my research is focused on the implementation issues of elliptic curve cryptography on embedded systems. Since I often have to ...