New Video from @Computerphile Explores SHA-3

The video from @Computerphile delves into the workings of SHA-3, an interesting and different variant of traditional hash functions like SHA-1, SHA-2, and MD5. SHA-3, also known as Secure Hash Algorithm 3, was designed to provide additional robustness in case security flaws are discovered in previous algorithms. The video highlights the sponge construction of SHA-3, a unique method that allows converting variable-length messages into a fixed-length hash while ensuring cryptographic security.

One of the key points of the video is the explanation of the sponge construction. This method involves two main phases: absorption and squeezing. During the absorption phase, the message is divided into blocks and integrated into the sponge, where it is mixed with internal data. Then, during the squeezing phase, the hash is extracted from the sponge. This method not only allows the generation of fixed-length hashes but also produces longer streams of random data if needed.

The video also details the reasons why SHA-3 was developed. In 2007, the cryptographic community began to worry about potential flaws in existing algorithms, even though no flaws had been discovered at that time. SHA-1, for example, was found vulnerable to collisions, leading to the adoption of SHA-2. However, SHA-2 also has some minor vulnerabilities, which motivated the creation of SHA-3 as a backup plan.

Technically, SHA-3 uses a function called Keccak, which was chosen from among 64 proposals in a competition organized by NIST. Keccak works by dividing the internal state into two parts: the rate and the capacity. The rate is the part that interacts with the input message and the output hash, while the capacity remains secret and helps ensure the algorithm's security. This structure allows SHA-3 to resist length-extension attacks, a common problem with SHA-2.

The video also explains the internal operations of Keccak, which are represented by a volume of 5x5x64 bits. Five main operations are applied to this volume to mix the bits effectively: theta, rho, pi, chi, and iota. Each operation has a specific role in mixing the bits, ensuring rapid diffusion of changes through the internal state. For example, theta mixes the bits using XOR operations on neighboring columns, while rho performs rotations on the 64-bit lanes.

In terms of practical implications, SHA-3 is currently used in some cryptographic applications, although it is not as widespread as SHA-2. It primarily serves as a backup plan in case flaws are discovered in SHA-2. The video emphasizes that SHA-3 is designed to be comparable in terms of performance and output size, which would allow for an easy transition if necessary.

In conclusion, the video from @Computerphile offers a detailed and accessible explanation of SHA-3, highlighting its unique mechanisms and its importance as a backup plan in the field of cryptography. To learn more, you can watch the full video at the following address: https://www.youtube.com/watch?v=fzlflyw7X2I