Sciweavers

583 search results - page 50 / 117
» On the Complexity of Matsui's Attack
Sort
View
CRYPTO
2004
Springer
79views Cryptology» more  CRYPTO 2004»
14 years 24 days ago
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
Antoine Joux
INDOCRYPT
2004
Springer
14 years 23 days ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora
FSE
2001
Springer
121views Cryptology» more  FSE 2001»
13 years 12 months ago
Producing Collisions for PANAMA
PANAMA is a cryptographic module that was presented at the FSE Workshop in ’98 by Joan Daemen and Craig Clapp. It can serve both as a stream cipher and as a cryptographic hash fu...
Vincent Rijmen, Bart Van Rompay, Bart Preneel, Joo...
ASIACRYPT
2006
Springer
13 years 11 months ago
Finding SHA-1 Characteristics: General Results and Applications
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
Christophe De Cannière, Christian Rechberge...
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
13 years 11 months ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich