Exam SY0-601 topic 1 question 231 discussion

Per prof. Messer's notes: "Rainbow tables won’t work with salted hashes"

Salting is a technique used to eliminate the use of precomputed tables like rainbow tables for password cracking. When passwords are stored in a database, a unique random value known as a salt is generated and appended to each password before hashing. This salt value makes each hashed password unique, even if two users have the same password. As a result, rainbow tables, which are precomputed tables of hash values for commonly used passwords, become ineffective because the same password will have different hash values due to the presence of different salts. By using salting, even if an attacker gains access to the hashed passwords, they cannot easily reverse-engineer the original passwords using precomputed tables, significantly improving the security of stored passwords.

Salt and Rainbows. Salt and Rainbows. Salt and Rainbows.

It’s might helps while we know rest of the options precisely: Hashing: Hashing is a technique that converts a password into a fixed-size string of characters. However, without salting, the same password will always produce the same hash, making it susceptible to rainbow table attacks. Tokenization: Tokenization is the process of replacing sensitive data with unique tokens. While it can enhance security in certain contexts, it’s not directly related to password cracking and doesn’t prevent rainbow table attacks. Asymmetric encryption: Asymmetric encryption involves using a pair of keys (public and private) to encrypt and decrypt data. It’s not primarily used for password storage and doesn’t address the issue of rainbow table attacks. In contrast, D. Salting Is the right answer

Defense against Rainbow Table Attacks Rainbow table attacks can easily be prevented by using salt techniques, which is a random data that is passed into the hash function along with the plain text. This ensures that every password has a unique generated hash and hence, rainbow table attack, which works on the principle that more than one text can have the same hash value, is prevented.

D = using salt techniques. you can find it on the internet.

I don't know if it eliminates the problem, but I'm going with salting.