Explore >> Select a destination
|
You are here 
|
unorde.red | ||
| | | | |
kndrck.co
|
|
| | | | | Motivation In my quest to understand zero knowledge proofs from the ground up, I've decided to go back to the basics, and really understand how everyday cryptography tools work, not just how to use them. In this post, I'll attempt to explain how and why the diffie hellman key exchange protocol works, along with proofs and a working example. The examples are purely for educational purposes only! Introduction The Diffie-Hellman key exchange protocol is an algorithm that allows two parties to generate a uni... | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text discusses the fundamentals of Elliptic Curve Cryptography (ECC), focusing on Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA). It explains how ECDH enables secure key exchange and how ECDSA allows for digital signatures. The text also covers the importance of secure random number generation in ECDSA, highlighting the risks of using a predictable or static secret key, as seen in the PlayStation 3 incident. The discussion includes code examples for ECDH and ECDSA operations and the consequences of poor implementation practices. The text concludes by mentioning future articles on solving discrete logarithms and ECC compared to RSA. | |
| | | | |
www.lapsedordinary.net
|
|
| | | | | ||
| | | | |
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. | ||
