Sciweavers

126 search results - page 3 / 26
» SMASH - A Cryptographic Hash Function
Sort
View
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
13 years 10 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
CAI
2007
Springer
13 years 6 months ago
On High-Rate Cryptographic Compression Functions
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
Richard Ostertág, Martin Stanek
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
12 years 9 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
ASIACRYPT
1992
Springer
13 years 10 months ago
On the Power of Memory in the Design of Collision Resistant Hash Functions
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
Bart Preneel, René Govaerts, Joos Vandewall...
CRYPTO
2008
Springer
70views Cryptology» more  CRYPTO 2008»
13 years 8 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