Capacity and Data Complexity in Multidimensional Linear Attack
From MaRDI portal
Publication:3457108
DOI10.1007/978-3-662-47989-6_7zbMath1369.94540OpenAlexW1928578723MaRDI QIDQ3457108
Jia-lin Huang, Xuejia Lai, Serge Vaudenay, Kaisa Nyberg
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/213634
Related Items (4)
Zero-correlation attacks: statistical models independent of the number of approximations ⋮ Multidimensional linear cryptanalysis ⋮ Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity ⋮ Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
Cites Work
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Bounds in Shallows and in Miseries
- On the Distribution of Linear Biases: Three Instructive Examples
- On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN
- Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- PRESENT: An Ultra-Lightweight Block Cipher
- The Independence of Linear Approximations in Symmetric Cryptanalysis
- Weak Keys of Reduced-Round PRESENT for Linear Cryptanalysis
- Markov Ciphers and Differential Cryptanalysis
- The effectiveness of the linear hull effect
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- New Links between Differential and Linear Cryptanalysis
- Linear Cryptanalysis of Reduced-Round PRESENT
- Probability distributions of correlation and differentials in block ciphers
- The Complexity of Distinguishing Distributions (Invited Talk)
- Correlation theorems in cryptanalysis
This page was built for publication: Capacity and Data Complexity in Multidimensional Linear Attack
