Applied Crypto #1: Elliptic Curve Cryptography | ZK Learning Resources
learn.0xparc.org · 850 words · saved by 1 readers
<iframe src="https://www.youtube.com/embed/m2BQrUL7RRg"
On this page Description Yan Zhang talks about elliptic curve cryptography. 🔑 Many cryptographic protocols rely on the fact that it is ‘hard’ to find discrete log in groups, which is known as the Discrete Log Problem (DLP). Two protocols of these protocols are the Diffie-Hellman Key Exchange and the Elgamal Public Key Cryptosystem . The Diffie-Hellman protocol is a way for two parties to securely derive a shared secret even in the presence of an eavesdropper and the Elgamal Cryptosystem allows one party to securely second a message to another party. To make this computation more efficient a
related reading
- ch26.pdfmath.auckland.ac.nz
- thesis.pdfaayushg.com
- Diffie–Hellman key exchange - Wikipediaen.wikipedia.org
- ants.dvicrypto.stanford.edu
- Elliptic-curve Diffie–Hellman - Wikipediaen.wikipedia.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 0xPARC0xparc.org
- There is no Diffie-Hellman but Elliptic Curve Diffie-Hellman – Key Materialkeymaterial.net
- What is the math behind elliptic curve cryptography?hackernoon.com
- A (Relatively Easy To Understand) Primer on Elliptic Curve Cryptography | The Cloudflare Blogblog.cloudflare.com
- ZK Learning Resourceslearn.0xparc.org
- 0xPARC0xparc.org