SHA1碰撞的概率 [英] Probability of SHA1 collisions

问题描述

给定一组长度相等的100个不同的字符串，您如何量化SHA1消化字符串碰撞不太可能的概率？

解决方案

SHA-1生成
的160位散列值是否足够大以确保
指纹每块的独特性？
假设具有
均匀分布的随机哈希值，
n不同数据块的集合和一个生成b位的哈希
函数，
概率p一个
或者更多的碰撞被
数量的块对数乘以
得到给定对
将发生碰撞的概率。

（来源： http://bitcache.org/faq/hash-collision-probability ）

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... ?

解决方案

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.

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

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