没有。

散列算法是不可逆的。你不能找回原来的数据，但你可以得到一个特定长度的所有可能的集合，通过计算哈希值的所有可能的组合和比较，你有散。

Hashing algorithms are not reversible. You can't get back the original data, but you can get all possible sets of a specific length by calculating the hash for all possible combinations and compare to the hash that you have.

这是当然imensely计算密集型。短短十例如字节为您提供了1 208 925 819 614 629 174 706 176组合测试...

This is of course imensely calculation intensive. Just ten bytes for example gives you 1 208 925 819 614 629 174 706 176 combinations to test...