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

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

The asymmetric cryptography on which so much security on the Internet is based relies on one of two mathematical assumptions to work: that it is impossible, other than through brute force, to ...

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

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