Chapter Quiz: Hashing - The Science of Digital Scrambling

Hashing & Scrambling Quiz

Complete this assessment with 100% score to master this chapter.

01How many 32-bit registers comprise the internal state of the MD5 algorithm?

02In SHA-1, how many 32-bit words is the initial 16-word message expanded into?

03Which mathematical property defines the 'Avalanche Effect'?

04What are the constants used in SHA-256 derived from?

05The 'Merkle-Damgård Construction' is a method for:

06Why is XOR (^) the preferred bitwise tool for cryptographic scrambling?

07What does 'Salting' a password hash prevent?

08What is the Birthday Paradox's relevance to hashing?

09A 'Collision' in hashing occurs when:

10Which hash algorithm is now considered cryptographically broken due to collision vulnerabilities?