Уровень 0 · материалов: 7
В кластер входят документы, описывающие технические методы защиты паролей с помощью криптографического хеширования и замедления процесса подбора, и не входят документы о других аспектах кибербезопасности.
Общие признаки: методы безопасного хранения паролей, защита от перебора и радужных таблиц, использование соли и итеративного хеширования, повышение вычислительной сложности для атакующего
Группа выше: Пароли: стойкость, хранение и взлом
Смысл: The main idea is that secure password storage requires slow, salted, one-way cryptographic hashes to protect against collision attacks, rainbow tables, and high-speed brute-force attempts.
The author explains why simple hashing is insufficient for passwords and advocates for the use of unique salts and computationally expensive algorithms like Blowfish to prevent cracking.
Смысл: The main idea is that simple MD5 hashing is insufficient for password security due to Rainbow Tables, and adding a 'salt' is a necessary and efficient way to protect hashes from being easily cracked.
The author explains how to protect MD5 password hashes from Rainbow Table attacks by using salting and dynamic salt updates.
Смысл: The main idea is that developers must move away from legacy hashing algorithms and implement a combination of modern functions (bcrypt/scrypt), unique salts, and system-level local parameters to ensure passwords remain secure even if the database is compromised.
Use bcrypt or scrypt with unique salts and a configuration-based local parameter to protect passwords from brute-force and precomputation attacks.
Смысл: The main idea is that increasing the computational cost of password hashing (key stretching) is an effective defense against brute-force and rainbow table attacks by making each guess significantly more expensive for the attacker while remaining unnoticed by the legitimate user.
The author explains and implements a method to intentionally slow down password hashing to make brute-force attacks computationally infeasible.
Смысл: The text proposes a novel method for storing password hashes where the link between the user and the hash is removed, and the hash table is filled with billions of dummy entries. This forces attackers to guess passwords against the entire database rather than specific users, making dictionary attacks computationally and financially prohibitive.
The author proposes hiding real password hashes among billions of dummy entries in a non-linked table to make dictionary attacks computationally impossible.
Смысл: The main idea is that repeatedly hashing a password to slow down attackers does not significantly compromise the cryptographic strength of the hash function, making it a viable security measure against brute-force and dictionary attacks.
Iterative password hashing effectively slows down brute-force attacks without significantly reducing the cryptographic strength of the underlying hash function.
Смысл: The main idea is that md5crypt is no longer secure against modern hardware (GPUs), and its creator is urging the industry to migrate to more computationally expensive, iterative hashing methods to protect user passwords from brute-force attacks.
md5crypt's creator warns that the algorithm is now easily crackable by GPUs and urges developers to switch to more secure, iterative password hashing methods.