Sciweavers

373 search results - page 1 / 75
» Two Attacks on Reduced IDEA
Sort
View
EUROCRYPT
1997
Springer
13 years 9 months ago
Two Attacks on Reduced IDEA
Johan Borst, Lars R. Knudsen, Vincent Rijmen
FSE
2005
Springer
98views Cryptology» more  FSE 2005»
13 years 10 months ago
New Attacks Against Reduced-Round Versions of IDEA
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 ro...
Pascal Junod
DSN
2007
IEEE
13 years 11 months ago
Multiprocessors May Reduce System Dependability under File-Based Race Condition Attacks
Attacks exploiting race conditions have been considered rare and “low risk”. However, the increasing popularity of multiprocessors has changed this situation: instead of waiti...
Jinpeng Wei, Calton Pu
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
13 years 9 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
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...
John Kelsey, Stefan Lucks
CARDIS
1998
Springer
110views Hardware» more  CARDIS 1998»
13 years 9 months ago
Reducing the Collision Probability of Alleged Comp128
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
Helena Handschuh, Pascal Paillier