๐ Introduction to Password Hashing
Password hashing is a fundamental security practice used to protect user credentials. Instead of storing passwords in plain text, which would be disastrous if a database were compromised, we store a one-way hash of the password. A good hashing algorithm makes it computationally infeasible to reverse the hash and recover the original password, even if the attacker has access to the hash.
๐ History and Background
Early systems often used simple hashing algorithms like MD5 or SHA-1, which were designed for general-purpose hashing and not specifically for password security. These algorithms were quickly found to be vulnerable to various attacks, including rainbow table attacks and collision attacks, due to their speed and lack of salt. The development of algorithms like bcrypt and Argon2 aimed to address these vulnerabilities by incorporating features like salting and key stretching, significantly increasing the computational cost for attackers.
๐ Key Principles of Password Hashing
- ๐ง Salting: Adding a unique, random string (the "salt") to each password before hashing. This prevents attackers from using pre-computed rainbow tables.
- ๐ช Key Stretching: Repeating the hashing process multiple times to increase the computational cost of brute-force attacks.
- โ๏ธ Adaptive Hashing: Algorithms that can be configured to increase the computational cost as hardware improves, maintaining security over time.
- ๐ Resistance to Side-Channel Attacks: Designing algorithms to be resistant to attacks that exploit implementation details, such as timing variations.
๐ก๏ธ Common Password Hashing Algorithms: Pros and Cons
Bcrypt
- โ Pros: Widely adopted, well-vetted, includes salting, and uses a work factor to control the computational cost.
- โ Cons: Relatively slow, but this is a deliberate feature for security. Memory usage is moderate.
- ๐งฎ Formula: The core of bcrypt relies on the Blowfish cipher. It doesn't have a simple mathematical representation like SHA algorithms, but it involves multiple rounds of key-dependent permutations and substitutions.
Argon2
- โ Pros: Winner of the Password Hashing Competition, designed to be resistant to GPU cracking, configurable memory usage, and parallelism. Offers different variants (Argon2d, Argon2i, Argon2id) for different security needs.
- โ Cons: More complex to implement than bcrypt. May be overkill for some applications.
- โ Formula: Argon2's core involves a complex combination of XOR operations, block permutations, and memory access patterns to resist various attack vectors. No single concise mathematical formula.
Scrypt
- โ Pros: Designed to resist ASIC-based attacks by requiring a large amount of memory.
- โ Cons: Can be resource-intensive, potentially impacting performance. Less widely adopted compared to bcrypt and Argon2.
- ๐ง Formula: Scrypt's core function, `Scrypt(PW, S, N, r, p, dkLen)`, doesn't have a simple formula either. It relies on repeated hashing and block mixing operations, controlled by parameters $N, r, p$ representing the CPU/memory cost, block size, and parallelization factor.
PBKDF2 (Password-Based Key Derivation Function 2)
- โ Pros: Widely available, relatively simple to implement, uses a pseudorandom function (e.g., HMAC-SHA256) and salting.
- โ Cons: Can be faster than bcrypt or Argon2 if not configured with a high iteration count, making it less secure. Iteration count needs to be chosen carefully.
- ๐ Formula: $DK = PBKDF2(PRF, Password, Salt, c, dkLen)$. $PRF$ is a pseudorandom function (e.g., HMAC-SHA256), $Password$ is the user's password, $Salt$ is the salt, $c$ is the iteration count, and $dkLen$ is the length of the derived key.
SHA-256 (with Salt)
- โ Pros: Widely available, fast.
- โ Cons: Not designed for password hashing, vulnerable to brute-force attacks if not properly salted and stretched. Should not be used without significant key stretching.
- โ๏ธ Formula: The SHA-256 algorithm takes an input message, pads it, and processes it through a series of rounds involving bitwise operations, modular addition, and message scheduling. No single compact formula represents the entire process.
๐งช Real-World Examples
- ๐ฆ Banking Apps: Often use Argon2 or bcrypt due to high security requirements.
- ๐๏ธ E-commerce Sites: May use bcrypt or PBKDF2 with a high iteration count.
- ๐ Web Forums: Historically used simpler methods like SHA-256 with salt, but are increasingly migrating to stronger algorithms like bcrypt.
โ
Conclusion
Choosing the right password hashing algorithm is crucial for protecting user data. While SHA-256 with salt is better than storing passwords in plain text, modern algorithms like bcrypt and Argon2 offer significantly improved security due to their resistance to brute-force and rainbow table attacks. When in doubt, opt for bcrypt or Argon2, configuring them with appropriate work factors or memory settings to balance security and performance. Remember to always use a unique salt for each password and avoid custom, untested hashing schemes.