How Far Can We Go Beyond Linear Cryptanalysis?
From MaRDI portal
Publication:5465830
DOI10.1007/978-3-540-30539-2_31zbMath1094.94025MaRDI QIDQ5465830
Serge Vaudenay, Thomas Baignères, Pascal Junod
Publication date: 12 August 2005
Published in: Advances in Cryptology - ASIACRYPT 2004 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-30539-2_31
94A60: Cryptography
Related Items
Making the Most of Your Samples, 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, The Complexity of Distinguishing Distributions (Invited Talk), Improved differential-linear attacks with applications to ARX ciphers, BehavioCog: An Observation Resistant Authentication Scheme, 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, Another look at normal approximations in cryptanalysis, Evolutionary cryptography against multidimensional linear cryptanalysis, 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, Multidimensional linear distinguishing attacks and Boolean functions, On quadratic approximations in block ciphers, Improved distinguishers for HC-128, Distinguishing attacks on stream ciphers based on arrays of pseudo-random words, 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, 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, Многомерный линейный метод и показатели рассеивания линейной среды шифрпреобразований, 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, 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
