Cryptography.
Table of Contents
Cryptography Notes/Resources
Non-Technical
- Aggregated Blockchains: A New Thesis → Polygon feb 24
- Electronification, Trading, and Crypto → Uniswap → Decentralization.
- A Cambrian Explosion of Crypto Proofs
- Symmetric Encryption is Quantum proof?
- Takeaway: asymmetric circuit-specific systems (Groth16) are shortest, shorter than all asymmetric universal ones, and all symmetric systems.
- Post Quantum Commitment Scheme → Merkle Trees.
- A Brief History of Money
- A medium of exchange is the asset we use to directly settle transactions. This is the easiest hurdle to clear. You can use Starbucks rewards points to buy a latte, so Starbucks points function as a medium of exchange. But of course, Starbucks points aren't a great store of value—people know this instinctively and don't store their savings into Starbucks points. This is not just because it's impractical; people are aware that Starbucks might modify their rewards program to devalue these points, and there's not a stable market for selling saved up points. → The US dollar can also be devaluated by some “Starbucks”.
- Money is just a bubble that never pops.
- The Cypherpunks
- Satoshi Nakamoto
- SNARK proving ASIC
Technical
- Elliptic Curve ZK-Proof Acceleration on AMD Versal
- "A deep dive into optimizing Multi-Scalar Multiplication" (Niall Emmart, Yrrid) - YouTube
- math - How could one implement multiplication in finite fields? - Stack Overflow
- Galois Field New Instructions (GFNI) Technology Guide → Faster multiplication with these instructions? Discovering novel algorithms with AlphaTensor - Google DeepMind
- Hash Functions
- Merkle Trees — Merkle Trees paper
- Hashcash
- Public-Key Cryptography
- ECC > RSA
- Zero Knowledge Proof - YouTube → How Tornado Works? → Practical use case of ZKP.
- Dual_EC_DRBG - Wikipedia → Elliptic Curves’ backdoor.
- https://github.com/lambdaclass/cairo-vm?tab=readme-ov-file#computational-integrity-and-zero-knowledge-proofs
- Crypto101
- Eth2Book
- FrontRunning
- How to Design Schnorr Signatures - YouTube
- RCIG_Coordination_Repo
- Extended Euclidean Algorithm
- Why do we need in RSA the modulus to be product of 2 primes? - Cryptography Stack Exchange
- Textbook RSA with exponent e=3 - Cryptography Stack Exchange
ZK-Proofs:
- Proof generation and verification: ZK-rollup operators must produce validity proofs for transaction batches, which is resource-intensive. Verifying zero-knowledge proofs on Mainnet also costs gas (~ 500,000 gas).
- An advantage of zero-knowledge proofs is that proofs can verify other proofs. For example, a single ZK-SNARK can verify other ZK-SNARKs. Such "proof-of-proofs" are called recursive proofs and dramatically increase throughput on ZK-rollups.
- ⚠️Producing validity proofs requires specialized hardware, which may encourage centralized control of the chain by a few parties.
Bootcamp:
- How arithmetic circuits are used to verify zero knowledge proofs
- The Zero Knowledge Blog
- Square Span Programs with Applications to Succinct NIZK Arguments
- 718.pdf
- 260.pdf
- Survey-SNARKs.pdf
- babySNARK
- programmers-introduction-to-mathematics
- Programming with Finite Fields – Math ∩ Programming
- Quadratic Arithmetic Programs: from Zero to Hero | by Vitalik Buterin | Medium
- Zk-SNARKs: Under the Hood. This is the third part of a series of… | by Vitalik Buterin | Medium
- [1906.07221] Why and How zk-SNARK Works
- Cryptohack
- Zero Knowledge Proofs for Kids
- ZK Book | RareSkills