Explore >> Select a destination
|
You are here 
|
rot256.dev | ||
| | | | |
vitalik.eth.limo
|
|
| | | | | [AI summary] An accessible technical introduction explaining how zk-SNARKs use polynomials, finite fields, and polynomial commitments to create succinct and private zero-knowledge proofs. | |
| | | | |
keymaterial.net
|
|
| | | | | One weird hobby of mine is reasonable properties of cryptographic schemes that nobody promised they do or don't have. Whether that's invisible salamanders or binding through shared secrets, anything that isn't just boring IND-CCA2 or existential unforgeability is just delightful material to construct vulnerabilities with. Normally, with a signature scheme, you have the public key... | |
| | | | |
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.johndcook.com
|
|
| | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | ||
