是否有一个蛮力的散列算法？ [英] Is there a bruteforce-proof hashing algorithm?

问题描述

好吧，从讨论哈希方法的弱点来看，我已经知道，唯一一个好的蛮力是有效的突破。

所以，问题是：

是否有一种哈希算法比其他方法更强硬？

在密码散列的情况下。

解决方案

对抗暴力的唯一保护是事实上需要非常长的时间来执行一个蛮力。

暴力破解的工作原理是简单地检查每个可能的输入字符串并尝试一次。没有办法防止简单地尝试每种可能的组合。

Well, from the discussion of hashing methods weaknesses, I've got that the only ol' good brute-force is efficient to break.

So, the question is:
Is there a hashing algorithm which is more rigid against brute-force than others?
In case of hashing passwords.

解决方案

The only protection against brute force is the fact that it takes an inordinately long time to perform a brute force.

Brute force works by simply going through every possible input string and trying it, one at a time. There's no way to protect against simply trying every possible combination.

这篇关于是否有一个蛮力的散列算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！