87 search results - page 7 / 18 » On Hashing with Tweakable Ciphers |
IMA
1997
Springer
15 years 1 months ago
1997
Springer
This paper reviews constructions of hash functions and MAC algorithms based on block ciphers. It discusses the main requirements for these cryptographic primitives, motivates these...
FSE
2005
Springer
15 years 3 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
CCS
2007
ACM
15 years 3 months ago
2007
ACM
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
CAI
2007
Springer
14 years 9 months ago
2007
Springer
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...
99
Voted
ACISP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present two (related) dedicated hash functions that deliberately borrow heavily from the block ciphers that appeared in the final stages of the AES process. We explor...