理论上，对哈希值进行解密是不可能的，但您可以使用一些肮脏的技术来获取原始的纯文本。

Bruteforcing: All computer security algorithm suffer bruteforcing. Based on this idea today's GPU employ the idea of parallel programming using which it can get back the plain text by massively bruteforcing it using any graphics processor. This tool hashcat does this job. Last time I checked the cuda version of it, I was able to bruteforce a 7 letter long character within six minutes. Internet search: Just copy and paste the hash on Google and see If you can find the corresponding plaintext there. This is not a solution when you are pentesting something but it is definitely worth a try. Some websites maintain the hash for almost all the words in the dictionary.

不。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哈希的能力——但它们都是包含字典单词、以前提交的密码和其他单词的庞大数据库。有一个非常小的机会，它将有你需要反向的MD5哈希。如果你已经咸MD5哈希-这也不会工作!：）

使用MD5哈希的登录方式应该是: 在注册过程中: 用户创建密码->密码使用数据库存储的MD5 ->哈希值进行哈希

在登录: 用户输入用户名和密码->(用户名选中)密码使用MD5哈希->哈希与数据库中存储的哈希进行比较

当需要“丢失密码”时: 2个选择:

用户发送一个随机密码来登录，然后在第一次登录时修改它。

or

用户会被发送一个链接来更改他们的密码(如果你有安全问题/等等)，然后新密码被散列，并用数据库中的旧密码替换

无法恢复md5密码。(任何语言)

但是你可以:

给用户一个新的。

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

在这里可以看到所有其他的答案，关于它如何以及为什么不可逆，以及为什么你不想这样做。

为了完整起见，这里有彩虹表，你可以在上面查找可能的匹配。不能保证彩虹表中的答案是用户选择的原始密码，这样会使用户非常困惑。

同样，这也不适用于咸散列。许多安全专家都建议用盐腌制。