搜索结果: 1-8 共查到“军队指挥学 near collision”相关记录8条 . 查询时间(0.141 秒)
Fast Near Collision Attack on the Grain v1 Stream Cipher
Cryptanalysis Stream ciphers Grain
2018/2/9
Modern stream ciphers often adopt a large internal state to resist various attacks, where the cryptanalysts have to deal with a large number of variables when mounting state recovery attacks. In this ...
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
hash function near-collision random-code
2016/1/9
In this paper we consider the problem of finding a near-collision with Hamming distance bounded by r in a generic cryptographic hash function h whose outputs can be modeled as random n-bit strings. In...
Near Collision Side Channel Attacks
Side channel collision attack leakage squeezing differential power analysis
2015/12/30
Side channel collision attacks are a powerful method to exploit side channel leakage.
Otherwise than a few exceptions, collision attacks usually combine leakage from distinct points in
time, making ...
Near-Collision Attack on the Step-Reduced Compression Function of Skein-256
Hash function Skein SHA-3
2012/3/29
The Hash function Skein is one of the 5 finalists of NIST SHA-3 competition. It is designed based on the threefish block cipher and it only uses three primitive operations: modular addition, rotation ...
New Pseudo-Near-Collision Attack on Reduced-Round of Hamsi-256
hash functions SHA-3 near collision
2009/10/9
Hamsi-256 is designed by ¨Ozg¨ul K¨uc¨uk and it has been a candidate Hash
function for the second round of SHA-3. The compression function of Hamsi-256 maps
a 256-bit chaining value and a 32-bit mes...
Near-Collision Attack on the Compression Function of Dynamic SHA2
Near-Collision Attack Compression Function Dynamic SHA2
2009/6/12
In this paper, we present a near-collision attack on the compression
functions of Dynamic SHA2 for all the output sizes. For the
Dynamic SHA2-224/256, the complexity is about 245 operations and for
...
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
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...
Near-Collision Attack and Collision-Attack on Double Block Length Compression Functions based on the Block Cipher IDEA
Hash Function Double Block Length Compression Function NearCollision Attack
2009/1/8
IDEA is a block cipher designed by Xuejia Lai and James L.
Massey and was first described in 1991. IDEA does not vary the constant
in its key schedule. In [1], Donghoon Chang and Moti Yung showed th...