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 factorization of integers and computation of discrete logarithms in polynomial time via the quantum computing-enabled Shor’s algorithm pose a major threat to traditional public-key cryptography.