SHA1 冲突的概率 [英] Probability of SHA1 collisions

问题描述

给定一组 100 个等长的不同字符串，您如何量化这些字符串不太可能发生 SHA1 摘要冲突的概率……?

Given a set of 100 different strings of equal length, how can you quantify the probability that a SHA1 digest collision for the strings is unlikely... ?

推荐答案

是否生成了 160 位哈希值通过 SHA-1 足够大以确保每个区块的指纹都是独一无二的?假设随机哈希值具有均匀分布，集合n 个不同的数据块和一个散列产生 b 位的函数，会有一个的概率 p或更多的碰撞受到限制相乘的块对数通过给定对的概率会碰撞.

Are the 160 bit hash values generated by SHA-1 large enough to ensure the fingerprint of every block is unique? Assuming random hash values with a uniform distribution, a collection of n different data blocks and a hash function that generates b bits, the probability p that there will be one or more collisions is bounded by the number of pairs of blocks multiplied by the probability that a given pair will collide.

(来源:http:///bitcache.org/faq/hash-collision-probabilities)

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