Sciweavers

713 search results - page 7 / 143
» Dispersing Hash Functions
Sort
View
81
Voted
JOC
1998
135views more  JOC 1998»
14 years 9 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
15 years 1 months ago
Bucket Hashing and its Application to Fast Message Authentication
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
Phillip Rogaway
DCC
2008
IEEE
15 years 9 months ago
A synthetic indifferentiability analysis of some block-cipher-based hash functions
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
Zheng Gong, Xuejia Lai, Kefei Chen
83
Voted
CRYPTO
2008
Springer
163views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Cryptanalysis of the GOST Hash Function
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
Florian Mendel, Norbert Pramstaller, Christian Rec...
68
Voted
ICIP
2008
IEEE
15 years 4 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy