(1 point) In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 6 ASCII characters. You can review the ASCII characters here.. There are exactly 27 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? 2^42 What is the equivalent key length in bits? 42 password every 10-8 Assuming that you could check one seconds, what is the worst case running time for cracking this password by brute force Now assume that the user used only 34 characters from the search (in days)? 0.509 keyboard. What is the key length in bits in this case? 30.52 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. 0.000178712963 Supposing you used only 34 characters, how long is the shortest password that achieves 206 bits of security? 41

(1 point) In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 6 ASCII characters. You can review the ASCII characters here.. There are exactly 27 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? 2^42 What is the equivalent key length in bits? 42 password every 10-8 Assuming that you could check one seconds, what is the worst case running time for cracking this password by brute force Now assume that the user used only 34 characters from the search (in days)? 0.509 keyboard. What is the key length in bits in this case? 30.52 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. 0.000178712963 Supposing you used only 34 characters, how long is the shortest password that achieves 206 bits of security? 41