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

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