The designers of the UNIX password algorithm used a 12-bit salt to perturb the f
ID: 656146 • Letter: T
Question
The designers of the UNIX password algorithm used a 12-bit salt to perturb the first and third sets of 12 entries in the E-table of the UNIX hashing function (the DES). Consider a system with 224 users. Assume that each user is assigned a salt from a uniform random distribution and that anyone can read the password hashes and salts for the users.
Assume that the passwords were eight characters long but that the salt length was increased to 24 bits. Again, the salts (and the corresponding algorithms) are known to all users. What would be the expected time to find all users' passwords using a dictionary attack?
Explanation / Answer
password is kind of directory in every operating system to provide the security of the data .the expected time to find all user password using a dictionary attack is " dictionary can per computed with the salt (2^12=4096)" for one password .so if the all users have the same password then in a neno second we can find . otherwise it would take the 4046 second for all the dictionary .