63 search results - page 7 / 13 » Attacking the Knudsen-Preneel Compression Functions |
SACRYPT
2009
Springer
15 years 4 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...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
At Crypto ’06, Bellare presented new security proofs for HMAC and NMAC, under the assumption that the underlying compression function is a pseudo-random function family. Converse...
115
click to vote
CHES
2011
Springer
13 years 9 months ago
2011
Springer
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
INDOCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We show that a 2112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis work, yet ...
INDOCRYPT
2009
Springer
15 years 4 months ago
2009
Springer
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper p...