A hash function takes an input of any size — a password, a file, a sentence, a multi-gigabyte disk image — and produces a fixed-length output, often called a digest or hash value. The same input always produces the same output, but even a one-bit change to the input should produce a completely different-looking digest. That deterministic, one-way transformation is the foundation for everything else in this module: password storage, file integrity checks, HMACs, and digital signatures all rest on it.
In this course you will meet hashing from two directions. In data structures, hash functions map keys into buckets of a hash table, where speed and even distribution matter most and collisions are expected and handled. In security, cryptographic hash functions must additionally resist attacks: it should be infeasible to recover the input from the digest (preimage resistance) or to find two inputs with the same digest (collision resistance). Recognizing that these are related but different design goals — and that MD5 is still fine for a checksum but broken for signatures — is a key takeaway.
As you watch, keep a short list going: What makes hashing different from encryption? (Hint: there is no key and no way back.) What does the avalanche effect look like in a worked example? Which algorithms are named, and what output lengths do they produce? Where does the speaker mention integrity verification, and what exactly is being compared to what?
A CompTIA Security+ lesson covering hashing and its role in digital signatures. Based on the title and exam objective 1.4, it should define hash functions as one-way digests, discuss collisions and algorithms such as MD5 and SHA, and explain how hashing is combined with public-key cryptography to provide integrity, authentication, and non-repudiation. Expect practical framing around verifying downloaded files and signing messages.
Professor Messer is a widely used, exam-aligned certification instructor whose explanations are concise and accurate, and this video connects the core properties of cryptographic hashes directly to data integrity — two of the subtopics here — while previewing the digital signature material later in the module.
A walkthrough of what hashing is, how it is used, and why it matters, with concrete MD5 and SHA2-256 examples. The description indicates the video steps through the hashing process and shows how it supports other security processes, so expect demonstrations of fixed-length output and how small input changes alter the digest entirely.
Seeing real MD5 and SHA-256 digests produced side by side makes fixed-length output and the avalanche effect tangible rather than abstract, and Adrian Cantrill is a well-regarded cloud and security trainer known for clear, example-driven explanations.
A lecture-style treatment of hash functions specifically as they are used in the hash table data structure, delivered with accompanying slides. It should cover how a hash function maps keys to array indices, what makes a hash function good for table use, and why collisions arise and must be handled.
This is the data-structures half of the picture that the security-oriented videos do not cover, and contrasting a hash-table hash function with a cryptographic one sharpens your understanding of what "core properties" actually means in each context.
These three videos build the shared vocabulary the rest of the module depends on. The MD5 and SHA-256 demonstrations and the discussion of collisions and one-way transformation prepare you for MO1, where you must distinguish hashing from encryption and compare preimage resistance, collision resistance, and the avalanche effect across algorithms. The integrity and digital signature material supports MO4 by showing how a digest is used to verify that data has not changed in transit or storage. The hash-table lecture clarifies why general-purpose hash functions are engineered for speed — the insight that later motivates MO2, MO3, and MO5, where deliberately slow, salted password hashing algorithms are introduced as the correct tool for credential storage.
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.