Explore >> Select a destination
|
You are here 
|
cronokirby.com | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] This technical post analyzes the security of Elliptic Curve Cryptography by detailing attack algorithms like Baby-step Giant-step and Pollard's rho, comparing them to RSA, and discussing the implications of quantum computing and potential NSA vulnerabilities. | |
| | | | |
www.jeremykun.com
|
|
| | | | | 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. | |
| | | | |
words.filippo.io
|
|
| | | | | A lot of new cryptography is landing in Go 1.20, including the new crypto/ecdh package and math/big-less RSA and ECDSA backends! | |
| | | | |
rareskills.io
|
|
| | | Elliptic Curves over Finite Fields What do elliptic curves in finite fields look like? It's easy to visualize smooth elliptic curves, but what do elliptic curves over a finite field look like? The following is a plot of $y² = x³ + 3 \pmod {23}$ Because we only allow integer inputs (more specifically, finite field... | ||
