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

Channel: ComputerphileGenerated by halstonDuration: 27mPublished Aug 20, 2025
Thumbnail for The Next Big SHA? SHA3 Sponge Function Explained - Computerphile ▶ Watch on YouTube

Video Chapters

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