How Far Can We Go Beyond Linear Cryptanalysis?
From MaRDI portal
Recommendations
- How Much Can Complexity of Linear Cryptanalysis Be Reduced?
- Provable security of block ciphers against linear cryptanalysis: a mission impossible?
- Linear and differential cryptanalysis: another viewpoint
- Whither Cryptography?
- Linear Cryptanalysis of Non Binary Ciphers
- Another look at success probability of linear cryptanalysis
- On linear cryptanalysis with many linear approximations
- Linear cryptanalysis using multiple linear approximations
- scientific article; zbMATH DE number 1406764
- scientific article; zbMATH DE number 5991351
Cited in
(65)- Cryptanalysis of an E0-like combiner with memory
- An overview of distinguishing attacks on stream ciphers
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack
- Multidimensional linear cryptanalysis
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
- Practical cryptanalysis of Bluetooth encryption with condition masking
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- Connections between quaternary and Boolean bent functions
- Linear cryptanalysis of FF3-1 and FEA
- Making the BKW algorithm practical for LWE
- Quantum algorithms for the resiliency of vectorial Boolean functions
- On the complexity of the BKW algorithm on LWE
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Another look at normal approximations in cryptanalysis
- How Much Can Complexity of Linear Cryptanalysis Be Reduced?
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- Multiple differential cryptanalysis: theory and practice
- Linear cryptanalysis of printcipher -- trails and samples everywhere
- On unbiased linear approximations
- Multidimensional linear method and diffusion characteristics of linear medium of ciphering transform
- An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers
- Coded-BKW: solving LWE using lattice codes
- Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
- Evolutionary cryptography against multidimensional linear cryptanalysis
- Linear Distinguishing Attack on Shannon
- New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
- Cryptanalysis of Rabbit
- Linear Slide Attacks on the KeeLoq Block Cipher
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Optimal Randomness Extraction from a Diffie-Hellman Element
- scientific article; zbMATH DE number 2009946 (Why is no real title available?)
- Making the Most of Your Samples
- Differential cryptanalysis of PRESENT-like cipher
- Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity
- On the Problem of Finding Linear Approximations and Cryptanalysis of Pomaranch Version 2
- Linear Cryptanalysis of Non Binary Ciphers
- Distinguishing Attack Against TPypy
- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses
- Experimenting linear cryptanalysis
- The Complexity of Distinguishing Distributions (Invited Talk)
- Fast Software Encryption
- BehavioCog: An Observation Resistant Authentication Scheme
- Optimal key ranking procedures in a statistical cryptanalysis.
- Improved differential-linear attacks with applications to ARX ciphers
- PNB-focused differential cryptanalysis of ChaCha stream cipher
- Prouff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage model
- A geometric approach to linear cryptanalysis
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- Distinguishing error of nonlinear invariant attacks
- Improved truncated differential distinguishers of AES with concrete S-box
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- Multidimensional linear distinguishing attacks and Boolean functions
- Vectorial fast correlation attacks
- \texttt{Transistor}: a TFHE-friendly stream cipher
- Multiple-tweak differential attack against SCARF
- On quadratic approximations in block ciphers
- A BKW-style solver for the restricted syndrome decoding problem
- Improved distinguishers for HC-128
- Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
This page was built for publication: How Far Can We Go Beyond Linear Cryptanalysis?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465830)
