The Cryptomat

This is my perpetual effort aimed at summarizing various concepts in cryptography.

You can start with some basic things:

• Pairings, or: “Versatile elliptic curves that power most modern crypto!”
• KZG polynomial commitments, or: “How to get succinctness if modern SNARKs?”
• RSA accumulators, or: “Who needs Merkle trees anyway?”

Or, you can learn about the most popular digital signature schemes:

• Threshold BLS, faster than most people know how to do it.
• ECDSA, or: “What most cryptocurrencies use for signing TXNs”
• Schnorr, and why you should prefer it over ECDSA.

Or, some esoteric ones:

• BBS+ signatures, or: “Did you know you can sign Pedersen commitments?”

Or, you can read some of my favorite things:

• Groth16, or: “Fastest-to-verify, most-succinct zkSNARK scheme”
• Authenticated Multipoint evaluation Trees (AMT)s, or “Homomorphic Merkle trees from KZG”
• Feist-Khovratovich (FK), or: “Why you may not need AMTs after all.”