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

Author Nick Sullivan worked for six years at Apple on many of its most important cryptography efforts before recently joining CloudFlare, where he is a systems engineer. He has a degree in mathematics ...

When it comes to public key cryptography, most systems today are still stuck in the 1970s. On December 14, 1977, two events occurred that would change the world: Paramount Pictures released Saturday ...

In August, a pair of mathematicians discovered an exotic, record-breaking curve. In doing so, they tapped into a major open question about one of the oldest and most fundamental kinds of equations in ...

Building a utility-scale quantum computer that can crack one of the most vital cryptosystems—elliptic curves—doesn’t require nearly the resources anticipated just a year or two ago, two independently ...

Using high school algebra and geometry, and knowing just one rational point on a circle or elliptic curve, we can locate infinitely many others. You’re sitting at the end of a long conference table, ...