/explore
|
You are here 
|
unorde.red | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
backdrifting.net
The Diffie-Hellman Key Exchange Made Simple |
|
| | | | | ||
| | | | |
www.lapsedordinary.net
|
|
| | | | | ||
| | | | |
denvaar.dev
[AI summary] This post explains the Diffie-Hellman key exchange algorithm, its history, the mathematical principles behind secure key sharing, and its applications in encryption. |
|
| | | |||
