搜索结果: 1-1 共查到“军事学 Collision and Near-Collision Attack”相关记录1条 . 查询时间(0.078 秒)
Complexity of the Collision and Near-Collision Attack on SHA-0 with Different Message Schedules
Collision and Near-Collision Attack SHA-0 Different Message Schedules
font style='font-size:12px;'>
2009/4/2
SHA-0 employs a primitive polynomial of degree 16 over
GF(2) in its message schedule. There are 2048 primitive polynomials
of degree 16 over GF(2). For each primitive polynomial, a SHA-0 variant
ca...