Assume that passwords are limited to the use of the 95printable ASCII characters

Question

Assume that passwords are limited to the use of the 95printable ASCII characters and that all the passwords are 10 characters in length. Assume a passwordcracker with an encryption rate of 6.4 million encryptions per second. How long will it take totest exhaustively all possible passwords on a Unix system? Assume that passwords are limited to the use of the 95printable ASCII characters and that all the passwords are 10 characters in length. Assume a passwordcracker with an encryption rate of 6.4 million encryptions per second. How long will it take totest exhaustively all possible passwords on a Unix system? Assume that passwords are limited to the use of the 95printable ASCII characters and that all the passwords are 10 characters in length. Assume a passwordcracker with an encryption rate of 6.4 million encryptions per second. How long will it take totest exhaustively all possible passwords on a Unix system?

Explanation / Answer

95*95*95*95*95*95*95*95*95*95/6.4million =95^10/6.4million

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.