Tag: Post-Quantum

Modern Cryptography & Zero-Knowledge Proofs (Part 20): Frontiers: Verifiable Delay Functions, Obfuscation & Quantum Key Distribution

Sequential proofs of work, Wesolowski VDFs, Indistinguishability Obfuscation (iO), and Quantum Key Distribution (BB84 protocol).

Nov 9, 2026 • 4 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 19): Multi-Party Computation (MPC): Yao’s Garbled Circuits, BGW Protocol & Secret Sharing

Secure multi-party computation, Yao's Millionaires' problem, Garbled Circuits, Oblivious Transfer, and BGW information-theoretic MPC.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 18): Fully Homomorphic Encryption (FHE): Gentry’s Bootstrapping, BGV, BFV & CKKS

Computing on encrypted data, noise accumulation in somewhat homomorphic schemes, Craig Gentry's bootstrapping blueprint, and the CKKS floating-point scheme.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 17): NIST Post-Quantum Standards: CRYSTALS-Kyber, CRYSTALS-Dilithium & SPHINCS+

The NIST PQC standardization process, Module-LWE (ML-KEM), Module-SIS (ML-DSA), and stateless hash-based signatures (SLH-DSA).

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 16): Post-Quantum Cryptography: Shor’s Threat & Lattice Hardness (SVP, CVP, LWE)

Shor's quantum period-finding algorithm, geometry of numbers, Shortest Vector Problem (SVP), and Learning With Errors (LWE).

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 15): Recursive Proofs & Folding Schemes: Halo2, Nova & HyperNova

Incrementally Verifiable Computation (IVC), cycle of elliptic curves (Pasta), recursive SNARK verifiers, and Nova non-interactive folding schemes.

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 14): Transparent Proofs: zk-STARKs, The FRI Protocol & Hash Soundness

Eliminating trusted setups, algebraic intermediate representations (AIR), Reed-Solomon proximity testing, and the Fast Reed-Solomon IOP of Proximity (FRI).

Nov 9, 2026 • 3 min read

Science

Modern Cryptography & Zero-Knowledge Proofs (Part 13): Universal zk-SNARKs: Plonk, Permutation Arguments & Plookup

Universal and updatable trusted setups, gate identity polynomials, grand product permutation arguments, and lookup arguments (Plookup).

Nov 9, 2026 • 3 min read

Learner Portal & Sync

Enrolled Academic Curricula (43 Disciplines)

My Earned Credentials

The Great Equations (MATH-101)

Loading question...