Physics Tools > Password recovery tool
Physics Tools > Password recovery tool
This online password recovery tool for security professionals, which
can be used to recover a password if its MD5 MD4 SHA1 hash is known.
MD5 / SHA1 are an industry standard hash algorithm that is used in
many applications to store passwords.
The table below shows the time required for password Attack depending
on the password length and used character set. It is assumed that
the attack is carried out on a single computer and the attack force
speed is 500 000 passwords per second.
Hash Conversion Tool | Passwords Generator with Hashes | Password Strength | Top 2000+ most common passwords
| Length of the password | Character set | |||
| lowercase letters | lowercase letters and digits | Both lowercase and uppercase letters | all printable ASCII characters | |
| < = 4 | instant | 2 min | ||
| 5 | instant | 2 min | 12 min | 4 hours |
| 6 | 10 min | 72 min | 10 hours | 18 days |
| 7 | 4 hours | 43 hours | 23 days | 4 years |
| 8 | 4 days | 65 days | 3 years | 463 years |
| 9 | 4 months | 6 years | 178 years | 44530 years |
The MD4, MD5 and SHA-1 algorithms are secure hash functions. They take a string input, and produce a fixed size number - 128 bits for MD4 and MD5; 160 bits for SHA-1. This number is a hash of the input - a small change in the input results in a substantial change in the output. The functions are thought to be secure, in the sense that it would require an enormous amount of computing power to find a string which hashes to a chosen value.
The SHA-1 is called secure because it is computationally infeasible to find a message which corresponds to a given message digest, or to find two different messages which produce the same message digest. Any change to a message in transit will, with very high probability, result in a different message digest, and the signature will fail to verify.
MD5 message-digest algorithm takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input. It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest.