On probability of success in linear and differential cryptanalysis

From MaRDI portal
Publication:2482339

DOI10.1007/s00145-007-9013-7zbMath1147.68510OpenAlexW2091612798MaRDI QIDQ2482339

Ali Aydın Selçuk

Publication date: 16 April 2008

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23230




Related Items (49)

Linear cryptanalysis of FF3-1 and FEADifferential-linear cryptanalysis from an algebraic perspectiveImproved (related-key) differential cryptanalysis on GIFTAnother look at normal approximations in cryptanalysisAffine linear cryptanalysisRelated-Key Cryptanalysis of MidoriCoded-BKW: Solving LWE Using Lattice CodesDifferential-linear cryptanalysis of the lightweight crytographic algorithm KNOTCapability of evolutionary cryptosystems against differential cryptanalysisEvolutionary cryptography against multidimensional linear cryptanalysisKey guessing strategies for linear key-schedule algorithms in rectangle attacksA correlation attack on full SNOW-V and SNOW-ViMultiple (truncated) differential cryptanalysis: explicit upper bounds on data complexityRevisiting the wrong-key-randomization hypothesisDifferential-linear cryptanalysis revisitedRigorous upper bounds on data complexities of block cipher cryptanalysisGeneralized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFTAutomatic Key Recovery of Feistel Ciphers: Application to SIMON and SIMECKOn the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2Another look at key randomisation hypothesesTruncated boomerang attacks and application to AES-based ciphersOptimization of $$\mathsf {LPN}$$ Solving AlgorithmsOptimizing rectangle attacks: a unified and generic framework for key recoveryAnd Rijndael? Automatic related-key differential analysis of RijndaelOptimising linear key recovery attacks with affine Walsh transform pruningLinear cryptanalysis of reduced-round SPECKAutomatic boomerang attacks search on RijndaelAccurate estimates of the data complexity and success probability for various cryptanalysesSecurity of the SMS4 block cipher against differential cryptanalysisDifferential attack on five rounds of the SC2000 block cipherImproved Differential Cryptanalysis of CAST-128 and CAST-256Multidimensional linear cryptanalysisDifferential attack on nine rounds of the SEED block cipherLombardi Drawings of Knots and LinksDISTINGUISHING ATTACKS ON BLOCK CIPHERS BY DIFFERENTIALS OF TWO-BLOCK TEXTSA methodology for differential-linear cryptanalysis and its applicationsMultiple 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 hypothesesDifferential-Multiple Linear CryptanalysisOn quadratic approximations in block ciphersCryptanalysis of CTC2Solving LPN using covering codesImproving key-recovery in linear attacks: application to 28-round PRESENTThe Cryptanalysis of Reduced-Round SMS4SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluationsA Differential-Linear Attack on 12-Round SerpentImproved differential-linear attack with application to round-reduced Speck32/64Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis



Cites Work


This page was built for publication: On probability of success in linear and differential cryptanalysis