Sciweavers

28 search results - page 4 / 6
» fse 2008
Sort
View
FSE
2008
Springer
115views Cryptology» more  FSE 2008»
13 years 10 months ago
On the Salsa20 Core Function
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...
Julio César Hernández Castro, Juan M...
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
13 years 10 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 10 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
FSE
2008
Springer
103views Cryptology» more  FSE 2008»
13 years 10 months ago
New Form of Permutation Bias and Secret Key Leakage in Keystream Bytes of RC4
Consider the permutation S in RC4. Roos pointed out in 1995 that after the Key Scheduling Algorithm (KSA) of RC4, each of the initial bytes of the permutation, i.e., S[y] for smal...
Subhamoy Maitra, Goutam Paul
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 10 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...