What is encrypted hash collision?
加密散列碰撞是什么？
Some vendors combine hash algorithms to reduce the possibility of a hash collision.
一些厂商结合散列算法，以减少哈希碰撞的可能性。
A method to handle hash collision with dual chain was introduced, and its affection on performance was analyzed, The design and implementation was given based on network processor IXP2400.
介绍了用两条链处理哈希表冲突问题的方法，分析了它对性能的影响，并以网络处理器IXP2400为例给出了具体设计和实现。
When a hash collision occurs, the system won't store the new data because it sees that its hash number already exists in the index... This is called a false positive, and can result in data loss.
当哈希冲突发生时，系统不会储存新数据，因为它看到它的散列人数已经存在于索引…这就是所谓的假阳性，并可能造成数据丢失。
The algorithms are designed so that the probability of two different sets of data computing the same hash value — a collision — is extremely small.
而所用密码算法在设计上要使从两组不同数据得到同一个散列值——即“碰撞”——的概率极其小。
However, in the case of the use of SHA-1, such as the existence of certain defects in the hash algorithm, with abundant resources of the attacker is able to achieve this kind of collision results.
然而，在使用SHA - 1等存在一定缺陷的散列算法的情况下，拥有充裕资源的攻击者确实能够实现这种碰撞结果。
Use of document storage systems such information, the use of tabs collision Hash algorithm, with the latest data cache memory to achieve efficient information retrieval.
利用文件系统存储这些信息，利用Hash碰撞分页算法，加上最新数据的内存缓存，实现高效的信息检索。
Then we analyze the influence on the security of challenge-response authentication by collision of hash from two aspects.
然后从两个层面对哈希函数的碰撞对问答认证的安全性可能产生的影响进行了分析。
The most important generic attack on the collision resistant is the birthday attack, it is used to attack all kinds of hash functions.
生日攻击是通用的碰撞攻击方法，它可用于攻击任何类型的散列函数。
With a large number of hash keys for a given number of rows, the likelihood of a collision decreases.
为给定数量的行准备很大数量的哈希关键，这可能降低冲突的可能。
With a large number of hash keys for a given number of rows, the likelihood of a collision decreases.
为给定数量的行准备很大数量的哈希关键，这可能降低冲突的可能。
应用推荐