ExamGecko
Question list
Search
Search

Related questions











Question 159 - 212-81 discussion

Report
Export

How can rainbow tables be defeated?

A.
Lockout accounts under brute force password cracking attempts
Answers
A.
Lockout accounts under brute force password cracking attempts
B.
All uppercase character passwords
Answers
B.
All uppercase character passwords
C.
Use of non-dictionary words
Answers
C.
Use of non-dictionary words
D.
Password salting
Answers
D.
Password salting
Suggested answer: D

Explanation:

Password salting

https://en.wikipedia.org/wiki/Salt_(cryptography)#Benefits

Salts also combat the use of hash tables and rainbow tables for cracking passwords. A hash table is a large list of pre-computed hashes for commonly used passwords. For a password file without salts, an attacker can go through each entry and look up the hashed password in the hash table or rainbow table. If the look-up is considerably faster than the hash function (which it often is), this will considerably speed up cracking the file. However, if the password file is salted, then the hash table or rainbow table would have to contain 'salt . password' pre-hashed. If the salt is long enough and sufficiently random, this is very unlikely. Unsalted passwords chosen by humans tend to be vulnerable to dictionary attacks since they have to be both short and meaningful enough to be memorized. Even a small dictionary (or its hashed equivalent, a hash table) is significant help cracking the most commonly used passwords. Since salts do not have to be memorized by humans they can make the size of the rainbow table required for a successful attack prohibitively large without placing a burden on the users.

asked 18/09/2024
Mita Balija
41 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first