International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Christophe De Cannière

Publications

Year
Venue
Title
2011
FSE
2011
FSE
2009
CHES
2008
CRYPTO
2006
ASIACRYPT
2004
CRYPTO
2004
EPRINT
On Multiple Linear Approximations
Alex Biryukov Christophe De Canni\`ere Michael Quisquater
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks based on this technique and derive explicit and compact gain formulas for generalized versions of Matsui's Algorithm 1 and Algorithm 2. The theoretical framework allows both approaches to be treated in a unified way, and predicts significantly improved attack complexities compared to current linear attacks using a single approximation. In order to substantiate the theoretical claims, we benchmarked the attacks against reduced-round versions of DES and observed a clear reduction of the data and time complexities, in almost perfect correspondence with the predictions. The complexities are reduced by several orders of magnitude for Algorithm 1, and the significant improvement in the case of Algorithm 2 suggests that this approach may outperform the currently best attacks on the full DES algorithm.
2003
CRYPTO
2003
EUROCRYPT
2003
FSE
2003
FSE
2003
EPRINT
Crytanalysis of SAFER++
Alex Biryukov Christophe De Canni\`ere Gustaf Dellkrantz
This paper presents several multiset and boomerang attacks on SAFER++ up to 5.5 out of its 7 rounds. These are the best known attacks for this cipher and significantly improve the previously known results. The attacks in the paper are practical up to 4 rounds. The methods developed to attack SAFER++ can be applied to other substitution-permutation networks with incomplete diffusion.

Program Committees

FSE 2014
Crypto 2009
FSE 2009