40 search results - page 4 / 8 » Some Plausible Constructions of Double-Block-Length Hash Fun... |
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
CRYPTO
1991
Springer
13 years 9 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
CRYPTO
2007
Springer
13 years 12 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
We initiate a study of on-line ciphers. These are ciphers that can take input plaintexts of large and varying lengths and will output the ith block of the ciphertext after having p...
IACR
2011
12 years 5 months ago
2011
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...