Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
From MaRDI portal
Publication:1667453
DOI10.1007/s12095-017-0268-zzbMath1419.94046OpenAlexW2772761214MaRDI QIDQ1667453
Palash Sarkar, Subhabrata Samajder
Publication date: 28 August 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-017-0268-z
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications of statistics (62P99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-correlation linear cryptanalysis of reduced-round LBlock
- Differential cryptanalysis of DES-like cryptosystems
- Rigorous upper bounds on data complexities of block cipher cryptanalysis
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- On probability of success in linear and differential cryptanalysis
- Multiple Differential Cryptanalysis Using LLR and χ 2 Statistics
- Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
- Multiple Differential Cryptanalysis: Theory and Practice
- The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA
- Multidimensional Extension of Matsui’s Algorithm 2
- An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers
- Cube Attacks on Tweakable Black Box Polynomials
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Higher Order Derivatives and Differential Cryptanalysis
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- Advances in Cryptology – CRYPTO 2004
- Probability and Computing
- How Far Can We Go Beyond Linear Cryptanalysis?
- Fast Software Encryption
This page was built for publication: Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
