About this interactive
A hash is a fingerprint of a file, a password or any other data: you put the data into the hashing algorithm and a string of characters comes out. The lesson listed what makes a good fingerprint, and the certutil demo proved several of them on a real file. This activity gives you observations and asks which property each one shows.
Fixed length. Whatever goes in, the fingerprint is the same size: MD5 is always 32 hex characters and SHA-256 always 64, for one letter or a whole video.
One-way. You cannot take the fingerprint and work backwards to the data. That is why a site that stores password hashes can reset your password but can never send you the old one.
The avalanche effect. A tiny change to the input, one character or one day on a date of birth, produces a completely different fingerprint. Two hashes give no hint of how similar their inputs were.
Same input, same hash. Hash the same data again, tomorrow or on another computer, and you get exactly the same fingerprint. This is what lets a server check a password: it hashes what you typed and compares the result with the stored hash.
Collision. Two different inputs that produce the same fingerprint. A good algorithm makes this extremely rare, and when collisions become easy to create, as they have for MD5, the algorithm can no longer be trusted to prove a file is genuine.
About TechKnowSurge
TechKnowSurge builds IT and cybersecurity professionals through hands-on, concept-first training built around real understanding — not memorization. Free interactive tools, structured programs, and 25+ years of real-world experience, all in one place.
Explore free tools and programs →