Rigorous upper bounds on data complexities of block cipher cryptanalysis
From MaRDI portal
Publication:1676236
DOI10.1515/jmc-2016-0026zbMath1372.94439OpenAlexW2760274525WikidataQ121831160 ScholiaQ121831160MaRDI QIDQ1676236
Subhabrata Samajder, Palash Sarkar
Publication date: 6 November 2017
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2016-0026
hypothesis testingblock cipherdifferential cryptanalysislinear cryptanalysisHoeffding's inequalityChernoff boundlog-likelihood ratio test
Related Items (6)
Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity ⋮ Improved truncated differential distinguishers of AES with concrete S-box ⋮ Towards closing the security gap of Tweak-aNd-Tweak (TNT) ⋮ Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems ⋮ Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses ⋮ On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another look at normal approximations in cryptanalysis
- Multidimensional linear distinguishing attacks and Boolean functions
- Differential cryptanalysis of DES-like cryptosystems
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Accurate estimates of the data complexity and success probability for various cryptanalyses
- On probability of success in linear and differential cryptanalysis
- Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Bounds in Shallows and in Miseries
- Multiple Differential Cryptanalysis Using LLR and χ 2 Statistics
- On the Distribution of Linear Biases: Three Instructive Examples
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
- On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN
- Multiple Differential Cryptanalysis: Theory and Practice
- The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA
- Multidimensional Extension of Matsui’s Algorithm 2
- Multidimensional Linear Cryptanalysis of Reduced Round Serpent
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
- The Independence of Linear Approximations in Symmetric Cryptanalysis
- Cube Attacks on Tweakable Black Box Polynomials
- Higher Order Derivatives and Differential Cryptanalysis
- Distinguishing Distributions Using Chernoff Information
- Advances in Cryptology – CRYPTO 2004
- Probability and Computing
- How Far Can We Go Beyond Linear Cryptanalysis?
- The Complexity of Distinguishing Distributions (Invited Talk)
- Fast Software Encryption
This page was built for publication: Rigorous upper bounds on data complexities of block cipher cryptanalysis
