Multiple Differential Cryptanalysis: Theory and Practice
From MaRDI portal
Publication:3013076
DOI10.1007/978-3-642-21702-9_3zbMath1282.94034OpenAlexW1846045953MaRDI QIDQ3013076
Benoît Gérard, Céline Blondeau
Publication date: 7 July 2011
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_3
time complexitydata complexitysuccess probabilityPRESENTmultiple differential cryptanalysisiterative block cipher
Related Items (15)
Cryptographic Analysis of All 4 × 4-Bit S-Boxes ⋮ Another look at normal approximations in cryptanalysis ⋮ An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers ⋮ Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ Structural evaluation of AES-like ciphers against mixture differential cryptanalysis ⋮ Weak rotational property and its application ⋮ Multidimensional spectral criterion for testing hypotheses on random permutations;Многомерный спектральный критерий для проверки гипотез о случайных подстановках ⋮ The phantom of differential characteristics ⋮ Two notions of differential equivalence on Sboxes ⋮ Differential cryptanalysis of PRESENT-like cipher ⋮ DISTINGUISHING ATTACKS ON BLOCK CIPHERS BY DIFFERENTIALS OF TWO-BLOCK TEXTS ⋮ Improved Attacks on Reduced-Round Camellia-128/192/256 ⋮ Improved (related-key) Attacks on Round-Reduced KATAN-32/48/64 Based on the Extended Boomerang Framework ⋮ Improbable differential attacks on \texttt{PRESENT} using undisturbed bits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- On probability of success in linear and differential cryptanalysis
- An approximation theorem for the Poisson binomial distribution
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Algebraic Techniques in Differential Cryptanalysis
- Differential Cryptanalysis of Reduced-Round PRESENT
- PRESENT: An Ultra-Lightweight Block Cipher
- Bit-Pattern Based Integral Attack
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
- Weak Keys of Reduced-Round PRESENT for Linear Cryptanalysis
- Markov Ciphers and Differential Cryptanalysis
- Linear Cryptanalysis of Reduced-Round PRESENT
- Probability distributions of correlation and differentials in block ciphers
- How Far Can We Go Beyond Linear Cryptanalysis?
- The Complexity of Distinguishing Distributions (Invited Talk)
This page was built for publication: Multiple Differential Cryptanalysis: Theory and Practice
