A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma

DOI10.1007/3-540-49264-X_3zbMath0973.94522OpenAlexW1564295073MaRDI QIDQ2757230

Carlo Harpes, Gerhard G. Kramer, James L. Massey

Publication date: 25 November 2001

Published in: Advances in Cryptology — EUROCRYPT ’95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-49264-x_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Can a differential attack work for an arbitrarily large number of rounds? ⋮ Another look at normal approximations in cryptanalysis ⋮ Capacity and Data Complexity in Multidimensional Linear Attack ⋮ Revisiting the wrong-key-randomization hypothesis ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 ⋮ Another look at key randomisation hypotheses ⋮ Nonlinear Invariant Attack ⋮ A theoretical analysis of generalized invariants of bijective S-boxes ⋮ A geometric approach to linear cryptanalysis ⋮ Distinguishing error of nonlinear invariant attacks ⋮ Accurate estimates of the data complexity and success probability for various cryptanalyses ⋮ On degree-\(d\) zero-sum sets of full rank ⋮ Multidimensional linear cryptanalysis ⋮ Upper estimates of imbalance of bilinear approximations for round functions of block ciphers ⋮ Partitioning cryptanalysis ⋮ Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems ⋮ Multiple Differential Cryptanalysis: Theory and Practice ⋮ Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses ⋮ Nonlinear invariant attack: practical attack on full SCREAM, iSCREAM, and Midori64 ⋮ Correlation theorems in cryptanalysis ⋮ Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes ⋮ Linear Cryptanalysis of Non Binary Ciphers ⋮ On quadratic approximations in block ciphers ⋮ A Statistical Saturation Attack against the Block Cipher PRESENT ⋮ Provable security of block ciphers against linear cryptanalysis: a mission impossible? ⋮ Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis

This page was built for publication: A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma