How Far Can We Go Beyond Linear Cryptanalysis?

From MaRDI portal
Publication:5465830

DOI10.1007/978-3-540-30539-2_31zbMath1094.94025OpenAlexW1570998442MaRDI 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




Related Items (52)

Linear cryptanalysis of FF3-1 and FEAAnother look at normal approximations in cryptanalysisAn All-In-One Approach to Differential Cryptanalysis for Small Block CiphersCoded-BKW: Solving LWE Using Lattice CodesFast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0Making the BKW algorithm practical for LWEEvolutionary cryptography against multidimensional linear cryptanalysisMultiple (truncated) differential cryptanalysis: explicit upper bounds on data complexityRigorous upper bounds on data complexities of block cipher cryptanalysisWhen are identification protocols with sparse challenges safe? The case of the Coskun and Herley attackOn the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2PNB-focused differential cryptanalysis of ChaCha stream cipherProuff and Rivain's formal security proof of masking, revisited. Tight bounds in the noisy leakage modelA geometric approach to linear cryptanalysisModeling and simulating the sample complexity of solving LWE using BKW-style algorithmsLinear Distinguishing Attack on ShannonDistinguishing error of nonlinear invariant attacksImproved truncated differential distinguishers of AES with concrete S-boxAccurate estimates of the data complexity and success probability for various cryptanalysesNew Features of Latin Dances: Analysis of Salsa, ChaCha, and RumbaMultidimensional linear cryptanalysisCryptanalysis of RabbitMultidimensional linear distinguishing attacks and Boolean functionsDifferential cryptanalysis of PRESENT-like cipherMaking the Most of Your SamplesQuantum algorithms for the resiliency of vectorial Boolean functionsNon-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystemsMultiple Differential Cryptanalysis: Theory and PracticeJoint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexitySuccess probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypothesesOn data complexity of distinguishing attacks versus message recovery attacks on stream ciphersPractical cryptanalysis of Bluetooth encryption with condition maskingOn the complexity of the BKW algorithm on LWEMaking masking security proofs concrete (or how to evaluate the security of any leaking device), extended versionLinear Slide Attacks on the KeeLoq Block CipherOn the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their GeneralizationsDistinguishing attacks on stream ciphers based on arrays of pseudo-random wordsConnections between quaternary and Boolean bent functionsLinear Cryptanalysis of Non Binary CiphersDistinguishing Attack Against TPypyOn quadratic approximations in block ciphersRelated-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the WeaknessesImproved differential-linear attacks with applications to ARX ciphersA Statistical Saturation Attack against the Block Cipher PRESENTOptimal Randomness Extraction from a Diffie-Hellman ElementМногомерный линейный метод и показатели рассеивания линейной среды шифрпреобразованийCryptanalysis of an E0-like combiner with memoryAn overview of distinguishing attacks on stream ciphersImproved distinguishers for HC-128Linear Cryptanalysis of PRINTcipher – Trails and Samples EverywhereThe Complexity of Distinguishing Distributions (Invited Talk)BehavioCog: An Observation Resistant Authentication Scheme




This page was built for publication: How Far Can We Go Beyond Linear Cryptanalysis?