143 search results - page 7 / 29 » Hash, Displace, and Compress |
SACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
CISC
2007
Springer
14 years 1 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 ...
ACISP
2007
Springer
14 years 1 months ago
2007
Springer
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
FSE
2006
Springer
13 years 11 months ago
2006
Springer
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We point out that the seemingly strong pseudorandom oracle preserving (PRO-Pr) property of hash function domain-extension transforms defined and implemented by Coron et. al. [12] ...