In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 1212 ASCII characters. You can review the ASCII characters here.. There are exactly 27=12827=128 ASCII characters; we will assume every character in the password is ASCII (non-printing characters are allowed). What is the size of the keyspace that consists of passwords of this form? ___ What is the equivalent key length in bits? ___ Assuming that you could check one password every 10−710−7 seconds, what is the worst case running time for cracking this password by brute force search (in days)? ___ Now assume that the user used only 2828 characters from the keyboard. What is the key length in bits in this case? ___ How many days, in the worst case, would it take to break this weaker password? You can't round to the nearest day here -- be as exact as possible. ___ Supposing you used only 2828 characters, how long is the shortest password that achieves 249249 bits of security? ___
In this problem we explore the relationship between password length and cryptographic security.
Suppose a password consists of 1212 ASCII characters. You can review the ASCII characters here.. There are exactly 27=12827=128 ASCII characters; we will assume every character in the password is ASCII (non-printing characters are allowed).
What is the size of the keyspace that consists of passwords of this form? ___
What is the equivalent key length in bits? ___
Assuming that you could check one password every 10−710−7 seconds, what is the worst case running time for cracking this password by brute force search (in days)? ___
Now assume that the user used only 2828 characters from the keyboard. What is the key length in bits in this case? ___
How many days, in the worst case, would it take to break this weaker password? You can't round to the nearest day here -- be as exact as possible. ___
Supposing you used only 2828 characters, how long is the shortest password that achieves 249249 bits of security? ___
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
