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

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

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

是的，你所要求的一切都是可能的。 在没有帮助的情况下“解密”MD5密码是不可能的，但是可以将MD5密码重新加密到另一种算法中，只是不能一蹴而就。

您要做的就是让用户能够使用旧的MD5密码登录到新系统。在他们登录时，他们已经给了你的登录程序一个未加密的密码版本，你证明与你拥有的MD5哈希匹配。然后，您可以将这个非散列密码转换为新的散列算法。

显然，这是一个扩展的过程，因为您必须等待用户告诉您密码是什么，但它确实有效。

(注意:七年后，哦，希望有人会发现它有用)

MD5哈希算法是不可逆的，所以MD5解码在不可能，但一些网站有批量设置密码匹配，所以你可以尝试在线解码MD5哈希。

在网上试试:

MD5解密

md5online

md5decrypter

MD5有它的弱点(见维基百科)，所以有一些项目，试图预先计算哈希值。维基百科也暗示了其中一些项目。我所知道(并且尊敬)的一个是ophrack。您不能告诉用户他们自己的密码，但您可以告诉他们一个有效的密码。但我想:还是给他们寄个新密码吧，以防他们忘了。

不。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密码。(任何语言)

但是你可以:

给用户一个新的。

找个彩虹表，也许能找回旧的。