/explore
|
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.bearssl.org
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
asecuritysite.com
|
|
| | | [AI summary] The provided code demonstrates the implementation of Elliptic Curve Diffie-Hellman (ECDH) key exchange using various elliptic curves. It includes functions for modular arithmetic, point operations on elliptic curves, and key generation. The code generates key pairs for Alice and Bob, computes shared secrets, and prints the results. The shared secret is derived from the x-coordinate of the resulting point. The page also includes references and licensing information for proper citation. | ||
