Accurate estimates of the data complexity and success probability for various cryptanalyses

DOI10.1007/s10623-010-9452-2zbMath1218.94040OpenAlexW1966655096MaRDI QIDQ2430686

Jean-Pierre Tillich, Céline Blondeau, Benoît Gérard

Publication date: 8 April 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9452-2

zbMATH Keywords

binomial distributiondifferential cryptanalysisdata complexitybeta distributionlinear cryptanalysisstatistical cryptanalysissuccess probabilityFeistal networknon-adaptive iterated attacks

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (14)

Another look at normal approximations in cryptanalysis ⋮ A correlation attack on full SNOW-V and SNOW-Vi ⋮ Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity ⋮ Revisiting the wrong-key-randomization hypothesis ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 ⋮ Reflection Cryptanalysis of PRINCE-Like Ciphers ⋮ Improved improbable differential attacks on ISO standard CLEFIA: expansion technique revisited ⋮ Differential cryptanalysis of round-reduced \texttt{SPEEDY} family ⋮ DISTINGUISHING ATTACKS ON BLOCK CIPHERS BY DIFFERENTIALS OF TWO-BLOCK TEXTS ⋮ Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems ⋮ Multiple Differential Cryptanalysis: Theory and Practice ⋮ On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers ⋮ Reflection cryptanalysis of PRINCE-like ciphers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• Tutorial on large deviations for the binomial distribution
• Decorrelation: a theory for block cipher security
• On probability of success in linear and differential cryptanalysis
• A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
• Markov Ciphers and Differential Cryptanalysis
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• How Far Can We Go Beyond Linear Cryptanalysis?
• The Complexity of Distinguishing Distributions (Invited Talk)
• Fast Software Encryption

This page was built for publication: Accurate estimates of the data complexity and success probability for various cryptanalyses