It is not yet possible to put in a hash of a password into an algorithm and get the password back in plain text because hashing is a one way thing. But what people have done is to generate hashes and store it in a big table so that when you enter a particular hash, it checks the table for the password that matches the hash and returns that password to you. An example of a site that does that is http://www.md5online.org/ . Modern password storage system counters this by using a salting algorithm such that when you enter the same password into a password box during registration different hashes are generated.

唯一可以工作的是(如果我们提到密码只是散列，没有添加任何类型的盐来防止重放攻击，如果是这样，你必须知道盐)顺便说一句，得到一个字典攻击工具，许多单词，数字等文件，然后创建两行，一行是单词，数字(在字典中)，另一个是单词的散列，并比较散列，如果匹配你得到它…

这是唯一的方法，不用进行密码分析。

不。MD5不是加密(尽管它可能被用作一些加密算法的一部分)，它是一个单向哈希函数。作为转换的一部分，大部分原始数据实际上“丢失”了。

Think about this: An MD5 is always 128 bits long. That means that there are 2128 possible MD5 hashes. That is a reasonably large number, and yet it is most definitely finite. And yet, there are an infinite number of possible inputs to a given hash function (and most of them contain more than 128 bits, or a measly 16 bytes). So there are actually an infinite number of possibilities for data that would hash to the same value. The thing that makes hashes interesting is that it is incredibly difficult to find two pieces of data that hash to the same value, and the chances of it happening by accident are almost 0.

A simple example for a (very insecure) hash function (and this illustrates the general idea of it being one-way) would be to take all of the bits of a piece of data, and treat it as a large number. Next, perform integer division using some large (probably prime) number n and take the remainder (see: Modulus). You will be left with some number between 0 and n. If you were to perform the same calculation again (any time, on any computer, anywhere), using the exact same string, it will come up with the same value. And yet, there is no way to find out what the original value was, since there are an infinite number of numbers that have that exact remainder, when divided by n.

That said, MD5 has been found to have some weaknesses, such that with some complex mathematics, it may be possible to find a collision without trying out 2128 possible input strings. And the fact that most passwords are short, and people often use common values (like "password" or "secret") means that in some cases, you can make a reasonably good guess at someone's password by Googling for the hash or using a Rainbow table. That is one reason why you should always "salt" hashed passwords, so that two identical values, when hashed, will not hash to the same value.

一旦一段数据通过哈希函数运行，就没有回头路了。

不直接。由于鸽子洞原理，有(可能)不止一个值散列到任何给定的MD5输出。因此，你不能肯定地扭转它。此外，MD5是为了使查找任何这样的反向哈希变得困难(然而，已经有产生冲突的攻击-也就是说，产生两个哈希到相同结果的值，但您无法控制最终的MD5值是什么)。

但是，如果将搜索空间限制为长度小于N的普通密码，则可能不再具有不可逆性属性(因为MD5输出的数量远远大于感兴趣域中的字符串数量)。然后，您可以使用彩虹表或类似的反向哈希。

要做到这一点并不容易。这就是首先对密码进行哈希的意义。:)

你应该做的一件事是手动为他们设置一个临时密码，并将其发送给他们。

我不愿提及这一点，因为这是一个坏主意(而且也不能保证一定有效)，但您可以尝试在彩虹表(如milw0rm)中查找散列，看看是否可以通过这种方式恢复旧密码。

理论上，你不能。哈希的意义在于它是单向的。这意味着如果有人设法获得哈希列表，他们仍然无法获得您的密码。此外，这意味着即使有人在多个网站上使用相同的密码(是的，我们都知道我们不应该这样做，但是……)任何访问站点A的数据库的人都不能在站点B上使用该用户的密码。

The fact that MD5 is a hash also means it loses information. For any given MD5 hash, if you allow passwords of arbitrary length there could be multiple passwords which produce the same hash. For a good hash it would be computationally infeasible to find them beyond a pretty trivial maximum length, but it means there's no guarantee that if you find a password which has the target hash, it's definitely the original password. It's astronomically unlikely that you'd see two ASCII-only, reasonable-length passwords that have the same MD5 hash, but it's not impossible.

MD5是一个不好的哈希密码:

它的速度很快，这意味着如果你有一个“目标”散列，尝试很多密码，看看你是否能找到一个散列到目标的密码是很便宜的。盐析对这种情况没有帮助，但它有助于增加寻找与使用不同盐析的多个哈希中的任何一个匹配的密码的代价。 我相信它有已知的缺陷，这使得它更容易发现冲突，尽管在可打印文本(而不是任意二进制数据)中发现冲突至少会更困难。

我不是安全专家，所以除了“不要使用自己的身份验证系统”之外，我不会给出具体的建议。从信誉良好的供应商那里找一个，然后使用它。安全系统的设计和实现都是一项棘手的工作。