The Next Big SHA? SHA3 Sponge Function Explained - Computerphile
Learn more about the Jane Street internship at https://jane-st.co/internship-computerphile-25 If a bug is found in SHA2, SHA3 is already waiting in the wings! Mike Pound takes us through how it works. Dr Mike Pound is based at the University of Nottingham. Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile This video was filmed and edited by Sean Riley. Computerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com
Video Chapters
- 0:00 Unveiling SHA3: The intriguing "Sponge Construction" concept
- 3:18 The Genesis of SHA3: NIST's competition and Keccak's triumph
- 4:11 Witness the "Sponge" in Action: A dynamic demonstration
- 5:58 Unpacking the Sponge: Decoding its 'rate' and 'capacity'
- 8:17 From Padding to Squeezing: How messages become secure data streams
- 11:23 SHA3's Fort Knox: Bulletproof against dangerous length extension attacks
- 12:48 The Heart of SHA3: A peek inside the 5x5x64 bit data cube
- 15:06 Theta (Θ): The first dance of bits in SHA3's internal mixer
- 20:56 Chi (χ) & Iota (ι): The secrets of non-linear mixing and round constants
- 22:50 The Need for Speed: How 64-bit operations boost SHA3's performance
Original Output
0:00 Unveiling SHA3: The intriguing "Sponge Construction" concept 3:18 The Genesis of SHA3: NIST's competition and Keccak's triumph 4:11 Witness the "Sponge" in Action: A dynamic demonstration 5:58 Unpacking the Sponge: Decoding its 'rate' and 'capacity' 8:17 From Padding to Squeezing: How messages become secure data streams 11:23 SHA3's Fort Knox: Bulletproof against dangerous length extension attacks 12:48 The Heart of SHA3: A peek inside the 5x5x64 bit data cube 15:06 Theta (Θ): The first dance of bits in SHA3's internal mixer 20:56 Chi (χ) & Iota (ι): The secrets of non-linear mixing and round constants 22:50 The Need for Speed: How 64-bit operations boost SHA3's performance Timestamps by McCoder Douglas
Unprocessed Timestamp Content
0:00 Intro to SHA3 and the quirky "sponge construction" concept 0:25 SHA3: a modern hash function, distinct from its predecessors 1:34 The origins of SHA3: avoiding future cryptographic vulnerabilities 3:18 NIST's SHA3 competition and Keccak's triumphant selection 4:11 A messy but effective demonstration of the sponge construction in action 5:58 Dissecting the sponge: understanding the rate and capacity 8:17 Message padding and the repeatable squeezing of random data 11:23 SHA3's robust design resists dangerous length extension attacks 12:48 Visualizing the internal state: a 5x5x64 bit data cube 15:06 Theta (Θ) operation: mixing bits with column-wise XOR sums 18:37 Rho (ρ) operation: rotating bits within the data lanes 19:30 Pi (π) operation: permuting bits across the entire state 20:56 Chi (χ) & Iota (ι) operations: non-linear mixing and round constants 22:50 The magic of implementation: 64-bit operations make it fast Timestamps by McCoder Douglas