Alice and Bobs Big Secret

### Cryptographic Building Blocks of Distributed Ledgers At 00:00, cybersecurity educator Mila Paul delivers a foundational guide exploring the mathematical and cryptographic primitives that underpin blockchain networks and decentralized ledgers.

### One-Way Hash Functions and SHA-256 Mechanics At 06:02, Paul deconstructs cryptographic hashing, analyzing SHA-256. She illustrates key security properties—pre-image resistance, second pre-image resistance, and collision resistance—demonstrating how one-way compression functions ensure tamper resistance in chained blocks.

### Merkle Trees and Efficient Transaction Verification At 12:00, the speaker details Merkle tree architectures. By organizing thousands of individual transactions into hierarchical cryptographic trees, distributed nodes can produce compact Merkle proofs, allowing lightweight clients to verify transaction inclusion without storing entire multi-gigabyte blockchain ledgers.

### Asymmetric Cryptography and Digital Signatures At 18:01, Paul explores asymmetric public-key cryptography. She contrasts symmetric encryption with elliptic curve digital signature algorithms (ECDSA and Ed25519), explaining how private keys generate cryptographic signatures that prove asset ownership without disclosing underlying secret keys.

### Emerging Frontiers: Zero-Knowledge Proofs and Quantum Threats Concluding between 24:03 and 30:01, Paul reviews emerging cryptographic frontiers. She introduces zero-knowledge proofs (zk-SNARKs) that enable transaction privacy, and concludes with an assessment of post-quantum cryptography needed to defend distributed ledgers against theoretical quantum factoring algorithms.

(AI summary — Gemini Flash)