The designers of the UNIX password algorithm used a 12-bit salt to perturb the f
ID: 656145 • 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 eight more characters were added to the password and that the DES algorithm was changed so as to use all 16 password characters. What would be the expected time to find all users' passwords using a dictionary attack?
Explanation / Answer
The simple case of sort checking is identifying instruction from information.the operation execute is performed solely on instruction and also the operation