Hash Algorithms and Applications: Password Hashing and Beyond

This reading introduces hashing algorithms by explaining what they are, how they transform arbitrary input into fixed-length output, and why they are central to security, data integrity, and authentication — serving as a conceptual starting point for learners new to the topic.

This reading explains the defining properties of cryptographic hash functions (arbitrary input, fixed-length digest, determinism, avalanche effect, and one-way nature), covering how they underpin modern information security and how learners should evaluate and distinguish them from general-purpose hash functions.

This reading covers why secure password storage matters, the history of mishandled credential storage, and the fundamentals of hashing passwords — explaining why plaintext and weakly hashed storage fail and establishing the baseline techniques learners and developers should apply.

This reading explains the salting technique — why it is necessary on top of basic password hashing, how unique salts defeat precomputed attacks such as rainbow tables, and what additional advanced password-protection strategies (e.g., key stretching, adaptive algorithms) learners and developers should adopt.

This reading describes how hash functions are used beyond passwords to verify data integrity — covering checksum verification for downloads, software package signing, and tampered-document detection — showing learners how to apply hashing as a practical integrity assurance tool.

This reading surveys common attacks that exploit weaknesses in hashing systems — such as brute-force, dictionary, rainbow table, collision, and length-extension attacks — helping learners and instructors understand what goes wrong when hash functions are misapplied or weakened.

This reading consolidates best practices for selecting and applying the right cryptographic hash algorithm for each use case (password storage, file integrity, digital signatures) and illustrates real-world applications, helping learners translate theoretical knowledge into correct implementation decisions.

A foundational reading that defines hash functions, digests, determinism, and the avalanche effect, giving learners the vocabulary and core concepts needed before moving into security-focused hashing topics.

A lesson contrasting the hash functions used for hash-table bucketing with cryptographic hash functions, explaining the added security properties (preimage, second-preimage, and collision resistance) and common algorithms like MD5 and SHA-256 that learners study to understand when each is appropriate.

A reading on why plain-text and simple cryptographic hashes are inadequate for password storage, walking learners through breach scenarios, password reuse risks, and the need for slow, purpose-built password hashing.

A topic page covering salting — adding unique random values per password — along with peppers, work factors, and defenses against precomputed rainbow tables, used by learners to understand how to store passwords safely.

A lesson applying hashing to data integrity, showing how digests verify downloaded files, detect tampering in messages, and serve as fingerprints that change drastically with any bit-level modification.

A survey of attacks against hashing schemes — brute-force, dictionary and wordlist attacks, rainbow tables, missing salts, outdated algorithms, and timing side channels — so learners can recognize and avoid these vulnerabilities in their own code.

A capstone reading that synthesizes the module into practical deployment guidance, including how to pick the right algorithm for the job (e.g., SHA-256 for integrity versus slow KDFs for passwords) and how hashing appears in real production systems.

A consolidated, all-in-one version of the module's readings compiled into a single document, useful for review, printing, or studying every topic from introduction through best practices in one pass.

This reading covers the same best-practices and real-world applications content as artifact 7, consolidating guidance on choosing appropriate hash algorithms by context and illustrating deployment scenarios — learners can use it as a reference or review resource alongside the preceding readings.