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 a rigorous general statistical framework which allows to interpret most of these attacks in a simple and unified way. Then, we explicitely construct optimal distinguishers, we evaluate their performance, and we prove that a block cipher immune to classical linear cryptanalysis possesses some resistance to a wide class of generalized versions, but not all. Finally, we derive tools which are necessary to set up more elaborate extensions of linear cryptanalysis, and to generalize the notions of bias, characteristic, and piling-up lemma.

• Type: Conference
• Year: 2004
• Where: ASIACRYPT
• Authors: Thomas Baignères, Pascal Junod, Serge Vaudenay
• Keywords: ASIACRYPT 2004, Classical Linear Cryptanalysis, Cryptology, General Statistical Framework, Linear Cryptanalysis