Question: Question 27 2.5 pts Salt ensures that attackers can't use specialized attacks like lookup tables and rainbow tables to crack large collections of hashes tuickly
Question 27 2.5 pts Salt ensures that attackers can't use specialized attacks like lookup tables and rainbow tables to crack large collections of hashes tuickly but it doesn't prevent them from running dictionary or brute-force attacks on each hash individually. High-end graphics cards (GPUs) and custom hardware can compute billions of hashes per second, so these attacks are still very effective. To make these attacks fess effective, we can Require two-factor authentication with a token Use a slow hash function Enforce a lockout policy Train users against social engineering tactics. Question 28 2.5 pts Along, random salt value prevents the attacker from decrypting the hashed password performing a dictionary attack once the hash value is retrieved using a faster hash operation pre-computing hash values for dictionary words
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
