md5的冲突率是多少？ [英] What is the clash rate for md5?

问题描述

md5算法冲突的概率是多少。我相信这是非常低的。

what's the probability for the clash for the md5 algorithm. I believe it is extremely low.

推荐答案

你需要哈希大约2 ^ 64个值，平均，如果你不尝试故意创建碰撞。哈希冲突与生日问题非常相似。

You need to hash about 2^64 values to get a single collision among them, on average, if you don't try to deliberately create collisions. Hash collisions are very similar to the Birthday problem.

如果你看两个任意值，碰撞概率只有2 ^-128 。

If you look at two arbitrary values, the collision probability is only 2^-128.

md5的问题是，不同的文本散列到相同的值。但这需要有意的攻击，不会偶然发生。即使有故意攻击，目前不可能获得与给定哈希匹配的纯文本。

The problem with md5 is that it's relatively easy to craft two different texts that hash to the same value. But this requires a deliberate attack, and doesn't happen accidentally. And even with a deliberate attack it's currently not feasible to get a plain text matching a given hash.

简而言之，md5对于非安全目的是安全的，但在许多安全应用程序。

In short md5 is safe for non security purposes, but broken in many security applications.

这篇关于md5的冲突率是多少？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！