Sciweavers

143 search results - page 5 / 29
» Hash, Displace, and Compress
Sort
View
CRYPTO
2008
Springer
70views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions ha...
Phillip Rogaway, John P. Steinberger
FSE
2010
Springer
149views Cryptology» more  FSE 2010»
15 years 2 months ago
Domain Extension for Enhanced Target Collision-Resistant Hash Functions
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
Ilya Mironov
LATINCRYPT
2010
14 years 8 months ago
Message Recovery and Pseudo-preimage Attacks on the Compression Function of Hamsi-256
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 functio...
Çagdas Çalik, Meltem Sönmez Tur...
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
15 years 1 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
CRYPTO
1997
Springer
156views Cryptology» more  CRYPTO 1997»
15 years 1 months ago
Fast and Secure Hashing Based on Codes
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
Lars R. Knudsen, Bart Preneel