搜索结果: 1-4 共查到“军队指挥学 Collision-Resistant Hashing”相关记录4条 . 查询时间(0.091 秒)
On Distributional Collision Resistant Hashing
Collision Resistant Hashing Distributional Hashing Multi-Collision Resistance
font style='font-size:12px;'>
2018/5/28
Collision resistant hashing is a fundamental concept that is the basis for many of the important cryptographic primitives and protocols. Collision resistant hashing is a family of compressing function...
Learning Parity with Noise Implies Collision Resistant Hashing
Learning Parity with Noise Collision Resistant Hashing binary Shortest Vector Problem
font style='font-size:12px;'>
2018/1/2
In addition to the feasibility established, we discuss also the practical relevance of the CRH functions constructed (from the hardness of LPN). Interestingly, the SHA-3 proposal Fast Syndrome Based (...
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
collision resistance multi collisions commitments
font style='font-size:12px;'>
2017/6/1
A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x1≠x2x1≠x2 s.t. h(x1)=h(x2)h(x1)=h(x2). Collision resistant hash functions are on...
Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys
Collision-free hash function Collision-intractable hash function Collision-resistant hash function
font style='font-size:12px;'>
2008/12/12
There is a foundational problem involving collision-resistant hash-functions: common
constructions are keyless, but formal definitions are keyed. The discrepancy stems from the
fact that a function ...