ASIACRYPT
2011
Springer
12 years 11 months ago
2011
Springer
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
CANS
2010
Springer
13 years 9 months ago
2010
Springer
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
CAI
2007
Springer
13 years 11 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...
IEICET
2008
13 years 11 months ago
2008
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to th...
FSE
2008
Springer
14 years 13 days ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
CRYPTO
2008
Springer
14 years 20 days ago
2008
Springer
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...
CRYPTO
1997
Springer
14 years 3 months ago
1997
Springer
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
FSE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
CISC
2007
Springer
14 years 5 months ago
2007
Springer
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...