Abstract
In this paper we introduce the method of bi-linear crypt-analysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased characteristics that combine for an arbitrary number of rounds. In particular, we present a practical attack on DES based on a 1-round invariant, the fastest known based on such invariant, and about as fast as the best Matsui's attack. For ciphers similar to DES, based on small S-boxes, we claim that BLC is very closely related to LC, and we do not expect to find a bi-linear attack much faster than by LC. Nevertheless we have found bi-linear characteristics that are strictly better than the best Matsui's result for 3, 7, 11 and more rounds. For more general Feistel schemes there is no reason whatsoever for BLC to remain only a small improvement over LC. We present a construction of a family of practical ciphers based on a big Rijndael-type S-box that are strongly resistant against linear cryptanalysis (LC) but can be easily broken by BLC, even with 16 or more rounds. © International Association for Cryptologic Research 2004.
Author supplied keywords
Cite
CITATION STYLE
Courtois, N. T. (2004). Feistel Schemes and Bi-linear Cryptanalysis (Extended Abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3152, 23–40. https://doi.org/10.1007/978-3-540-28628-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.