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 Impending Quantum Threat to Bitcoin In the world of cryptocurrencies, security is king. Bitcoin, powered by the revolutionary blockchain ...

Part one explained the physics of quantum computing. This piece explains the target — how bitcoin's encryption works, why a ...

Hidden inside a simple color-mixing analogy is one of the most elegant ideas in cryptography, a mathematical trap door that lets two strangers build a shared secret in plain sight. This is the story ...

Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic ...

Traditional encryption methods have long been vulnerable to quantum computers, but two new analyses suggest a capable enough machine may be built much sooner than previously thought ...

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