Sciweavers

87 search results - page 4 / 18
» On Hashing with Tweakable Ciphers
Sort
View
DAGSTUHL
2007
14 years 11 months ago
A Collision-Resistant Rate-1 Double-Block-Length Hash Function
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...
Stefan Lucks
FSE
1993
Springer
148views Cryptology» more  FSE 1993»
15 years 1 months ago
Design Principles for Dedicated Hash Functions
Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed specifically for hashing. They intend to form a practical alternative for ...
Bart Preneel
CRYPTO
2001
Springer
117views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Online Ciphers and the Hash-CBC Construction
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...
Mihir Bellare, Alexandra Boldyreva, Lars R. Knudse...
FC
1998
Springer
121views Cryptology» more  FC 1998»
15 years 1 months ago
Cryptanalysis of SPEED
Abstract. The cipher family SPEED (and an associated hashing mode) was recently proposed in Financial Cryptography '97. This paper cryptanalyzes that proposal, in two parts: F...
Chris Hall, John Kelsey, Bruce Schneier, David Wag...
CRYPTO
1993
Springer
131views Cryptology» more  CRYPTO 1993»
15 years 1 months ago
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
Bart Preneel, René Govaerts, Joos Vandewall...