/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.imperialviolet.org
| | andrea.corbellini.name
1.1 parsecs away

Travel
| | [AI summary] A technical blog post explaining elliptic curves over finite fields, covering modular arithmetic, point addition algorithms, cyclic subgroups, and the discrete logarithm problem in the context of cryptography.
| | www.jeremykun.com
1.1 parsecs away

Travel
| | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition.
| | blog.lambdaclass.com
1.3 parsecs away

Travel
| | Elliptic curves (EC) have become one of the most useful tools for modern cryptography. They were proposed in the 1980s and became widespread used after 2004. Its main advantage is that it offers smaller key sizes to attain the same level of security of other methods, resulting in smaller storage
| | www.livescience.com
23.5 parsecs away

Travel
| When quantum computers become commonplace, current cryptographic systems will become obsolete. Scientists are racing to get ahead of the problem and keep our data secure.