Exhaustive Password Cracking Question
Posted on 2005-04-05
Assume that the passwords are limited to the use of 95 printable ASCII characters and that all passwords are 10 characters in length. Assume a password cracker with an encryption rate of 6.4 million per second. How long will it take to test exhaustively all possible passwords on a UNIX system?
95^10 = 59,873,693,923,837,890,625 possible passwords
59,873,693,923,837,890,625 possible passwords / 6,400,000 passwords per sec ~= 9355264675600 seconds
9355264675600 seconds / 60 sec per minute ~= 155921077927 minutes
155921077927 minutes / 60 minutes per hour ~= 2598684632 hours
2598684632 hours / 24 hours per day ~= 108278526 days
108278526 days / 365 days per year ~= 296653 years
So, does this seem correct? I dont think it is since 296,653 years is ... well ... kinda a long time
Anyways, I know theres no 'homework' questions here so dont gimme no flame .. this is a 'tutor' question :D
If no one is allowed to help on this then ... I WANT MAH MONAY BACK! .. haha j/k
Instead .. can someone explain to me what an encryption rate is and how it relates to password cracking?