搜索结果: 1-5 共查到“密码学 collision search”相关记录5条 . 查询时间(0.062 秒)
Iterative collision search procedures play a key role in developing combinatorial algorithms for the subset sum and learning parity with noise (LPN) problems. In both scenarios, the single-list pair-w...
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography
post-quantum cryptography symmetric cryptography collision search
2017/9/7
The cryptographic community has widely acknowledged that the emergence of large quantum computers will pose a threat to most current public-key cryptography. Primitives that rely on order-finding prob...
Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks. Implementations available in the litera...
Branching Heuristics in Differential Collision Search with Applications to SHA-512
hash functions cryptanalysis SHA-512
2016/1/23
In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out of 80) steps with complexity 240.5 . The best previously published result was on 24 steps. The attack is b...
Short collision search in arbitrary SL2 homomorphic hash functions
SL2 hash homomorphic hash
2014/3/12
We study homomorphic hash functions into SL2(q), the 2x2 matrices with determinant 1 over the field with q elements. Modulo a well supported number theoretic hypothesis, which holds in particular for ...