Can y'all help me with this questions. I don't know what to do
2. Imagine a "file-based/static/pre-computed" type dictionary attack for cracking all the words in a language of 100,000 words. Suppose, when utilized as passwords, these are hashed as-is (unsalted), and the result then stored. To attack this, the cracker creates his dictionary in advance by 1) hashing all 100,000 words from a to z, then 2) re-sorting his dictionary on the hashes. Then, given a hashed password to crack, he simply looks it up and there he finds the original, plaintext password.
Without salt:
a) the number of different ways a password can come out if hashed with a standard algorithm (e.g. sha1) using no salt, is ____.
b) the number of entries there will be in the dictionary the cracker must create is_____
.
Now imagine that a 2-byte salt is introduced, randomly chosen then prefixed to each word before it is hashed and stored for use as a password.
With salt:
c) the number of different ways a password could come out if hashed when prefixed with a random 2-byte salt is ______.
d) the number of entries will there be in the dictionary the cracker must create is _______
.
e) if all the words in the language are 8 characters long and resolve to hashes 22 bytes long, thus requiring 30 bytes to store each mapped pair (dictionary entry), then the number of gigabytes the cracker's dictionary must occupy is ._______