Sciweavers

396 search results - page 63 / 80
» Contemporary Block Ciphers
Sort
View
ASIACRYPT
2005
Springer
15 years 10 months ago
An Analysis of the XSL Algorithm
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...
Carlos Cid, Gaëtan Leurent
FSE
2005
Springer
98views Cryptology» more  FSE 2005»
15 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
ASIACRYPT
2004
Springer
15 years 10 months ago
How Far Can We Go Beyond Linear Cryptanalysis?
Abstract. Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define ...
Thomas Baignères, Pascal Junod, Serge Vaude...
LICS
2003
IEEE
15 years 9 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
INDOCRYPT
2003
Springer
15 years 9 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa