(1 point) In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 9 ASCII characters. You can review the ASCII characters here.. Exactly 27 = 128 of these codes are for printable characters; we will assume every character in the password is printable. What is the size of the keyspace that consists of passwords of this form? 128^9 What is the equivalent key length in bits? 63 Assuming that you could check one password every 10-6 seconds, what is the worst case running time for cracking this password by brute force search (in days)? 106751991.167 Now assume that the user used only 26 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 42 weaker password? You can't round to the nearest day here be as exact as possible. 42 -- Supposing you used only 26 characters, how long is the shortest password that achieves 97 bits of security? 21

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

im sure what step im missing.

(1 point) In this problem we explore the relationship between password length and cryptographic
security.
Suppose a password consists of 9 ASCII characters. You can review the ASCII characters here..
Exactly 27
= 128 of these codes are for printable characters; we will assume every character in the
password is printable.
What is the size of the keyspace that consists of passwords of this form?
128^9
What is the equivalent key length in bits? 63
Assuming that you could
check one password every 10-6 seconds, what is the worst case running time for cracking this
password by brute force search (in days)? 106751991.167
Now assume that the
user used only 26 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
42
weaker password? You can't round to the nearest day here be as exact as possible.
42
--
Supposing you used only 26 characters, how long is the shortest
password that achieves 97 bits of security? 21
Transcribed Image Text:(1 point) In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 9 ASCII characters. You can review the ASCII characters here.. Exactly 27 = 128 of these codes are for printable characters; we will assume every character in the password is printable. What is the size of the keyspace that consists of passwords of this form? 128^9 What is the equivalent key length in bits? 63 Assuming that you could check one password every 10-6 seconds, what is the worst case running time for cracking this password by brute force search (in days)? 106751991.167 Now assume that the user used only 26 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 42 weaker password? You can't round to the nearest day here be as exact as possible. 42 -- Supposing you used only 26 characters, how long is the shortest password that achieves 97 bits of security? 21
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,