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

This is a preview. Log in through your library . Abstract We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite ...

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 at Black Hat USA 2013 made a call for usage of elliptic curve cryptography in favor of the RSA algorithm, which the experts said could be cracked in the next five years. LAS VEGAS – ...

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

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

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

FIPS 203 for ML-KEM (also known as CRYSTALS-Kyber) FIPS 204 for ML-DSA (also known as CRYSTALS-Dilithium) FIPS 205 for SLH-DSA (also known as Sphincs+) The publication of these draft standards is an ...