搜索结果: 1-15 共查到“密码学 Compression Function”相关记录16条 . 查询时间(0.078 秒)
A Tweak for a PRF Mode of a Compression Function and Its Applications
compression function MAC pseudorandom function
2016/6/22
We discuss a tweak for the domain extension called Merkle-Damg錼d with Permutation (MDP), which was presented at ASIACRYPT 2007. We first show that MDP may produce multiple independent pseudorandom fun...
Provable Security of BLAKE with Non-Ideal Compression Function
secret-key cryptography / SHA-3 BLAKE collision resistance
2012/6/14
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
Provable Security of BLAKE with Non-Ideal Compression Function
secret-key cryptography / SHA-3 BLAKE collision resistance (second) preimage resistance indifferentiability
2012/3/22
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
Provable Security of BLAKE with Non-Ideal Compression Function
secret-key cryptography / SHA-3, BLAKE collision resistance (second) preimage resistance indifferentiability
2012/3/21
We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the HAIFA design methodology, and as such it achieves optimal preimage, second preimage and collision resistance, a...
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 ...
Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
Cryptanalysis Hash Functions SHA-3 ECHO-256 Collision attack
2010/11/10
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to four rounds in 2^52 ope...
Cryptanalysis of the Compression Function of SIMD
SIMD SHA-3 Candidate near collision distinguishing attack
2010/7/13
SIMD is one of the second round candidates of the SHA-3 competition hosted by NIST. In this paper, we present some results on the compression function of SIMD 1.1 (the tweaked version) using the modul...
Differential Distinguishers for the Compression Function and Output Transformation of Hamsi-256
hash functions differential cryptanalysis SHA-3
2010/3/16
Hamsi is one of 14 remaining candidates in NIST's Hash Competition for the future
hash standard SHA-3. Until now, little analysis has been published on its resistance to di erential cryptanalysis, th...
Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256
Hash functions SHA-3 competition cryptanalysis
2010/2/20
Hamsi is one of the second round candidates of the SHA-3
competition. In this study, we present non-random differential properties
for the compression function of the hash function Hamsi-256. Based
...
In this work, we apply the rebound attack to the AES based
SHA-3 candidate Lane. The hash function Lane uses a permutation
based compression function, consisting of a linear message expansion
and 6...
In this work, we apply the rebound attack to the AES based
SHA-3 candidate Lane. The hash function Lane uses a permutation
based compression function, consisting of a linear message expansion
and 6...
On the Randomness and Regularity of Reduced EDON-R Compression Function
hash function randomness regularity balance
2009/6/15
EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard
called SHA-3. Its construction is based on algebraic properties of non-commutat...
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
...
This report presents analysis of the compression function of
a recently proposed hash function, FORK-256. We exhibit some unex-
pected differentials existing for the step transformation and show th...
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
Hash function Random oracle Ideal cipher model
2008/6/30
In this paper, we introduce new compression function design
principles supporting variable output lengths (multiples of size n). They
are based on a function or block cipher with an n-bit output siz...
