/explore
|
You are here 
|
blog.cryptohack.org | ||
| | | | |
unorde.red
|
|
| | | | | [AI summary] This article explains the Diffie-Hellman key exchange algorithm, its mathematical foundation in discrete logarithm problems, and its security implications in modern cryptography. | |
| | | | |
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. | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [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.paragonie.com
|
|
| | | An analysis of the deficits in the security features offered by WordPress, Drupal, and Joomla. | ||
