Everything you have learned about hash functions in this module comes together here: how practitioners actually choose and deploy hashing in production systems. Choosing "the right hash for the job" is not one decision but several — a fast general-purpose digest like SHA-256 is appropriate for file integrity and digital signatures, while password storage calls for a deliberately slow, memory-hard algorithm such as bcrypt, scrypt, or Argon2 with per-user salts and a tuned work factor. The same primitive also appears in message authentication (HMAC), in TLS handshakes and certificates, in blockchain block linking and Merkle trees, and in digital forensics where a hash value serves as a tamper-evident fingerprint of seized evidence.
This matters in COP3530 because hashing is where a data structures concept meets real security consequences. A hash table and a password database use the same underlying idea, but the engineering requirements are opposite: one wants speed, the other wants slowness and unpredictability. Understanding that distinction — and the surrounding practices of salting, peppering, key stretching, standards compliance, and periodic re-evaluation as hardware improves — is what separates a working implementation from a safe one.
As you watch the videos below, keep three questions in mind. First, what property of the hash function is each application relying on (preimage resistance, collision resistance, the avalanche effect, or just speed)? Second, what attack is each countermeasure defending against — a salt stops rainbow tables, a pepper defends against a database-only leak, a work factor slows brute force. Third, where does the secret live in each scheme: in nothing (a plain digest), in a stored server-side value (a pepper), in a shared key (HMAC), or in a private key (digital signatures).
This video walks through what an attacker can actually do with a leaked password database and why storing raw or naively hashed passwords fails. It explains salting as a per-user random value that defeats precomputed rainbow tables, peppering as a secret value kept outside the database, and how these combine with hashing in a realistic authentication flow.
It directly addresses the salting and peppering subtopic with a practical, attacker-centered framing, and mCoding is a well-regarded programming channel known for careful, implementation-level explanations rather than hand-waving.
A short whiteboard-style overview of how hash functions are used in blockchain systems — how a block's contents are reduced to a fixed-length digest, how each block references the hash of the previous one, and why changing any past data invalidates the chain. Expect coverage of basic hash properties such as determinism and the avalanche effect in the context of distributed ledgers.
It gives concise, beginner-friendly coverage of the blockchain and distributed ledger subtopic, connecting the abstract collision-resistance property you studied earlier to a concrete tamper-evidence mechanism.
Reviewed a second time, this video is also the best single reference in the set for the vocabulary used by compliance frameworks and certification standards around hashing and signatures. Watch it again with an eye to terminology you will need when reading security documentation.
Its standards-oriented presentation supports the industry standards, compliance, and ongoing vigilance subtopic, where precise and conventional terminology matters.
Together these videos move from theory to deployment. The mCoding video is the core support for MO2, MO3, and MO5, showing why dedicated password hashing with salts, peppers, and work factors beats a bare cryptographic digest and what an attacker gains from a leaked database. The Professor Messer lesson supports MO1 and MO4 by contrasting hashing with encryption-based mechanisms and showing how digests, HMACs, and digital signatures provide integrity and authenticity in software distribution, secure communications, and forensic evidence handling. The blockchain video reinforces MO1 and MO4 from a different angle, demonstrating how collision resistance and the avalanche effect make chained hashes a practical tamper-detection structure. Watched as a set, they give you the comparative judgment MO1 through MO5 ask for: knowing not just how hash functions work, but which one to reach for in a given situation and why.
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.