Rigorous upper bounds on data complexities of block cipher cryptanalysis

DOI10.1515/JMC-2016-0026zbMATH Open1372.94439OpenAlexW2760274525WikidataQ121831160 ScholiaQ121831160MaRDI QIDQ1676236FDOQ1676236

Authors: 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

Recommendations

• Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
• Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• Another look at normal approximations in cryptanalysis
• scientific article; zbMATH DE number 1952897

zbMATH Keywords

hypothesis testingblock cipherdifferential cryptanalysislinear cryptanalysisHoeffding's inequalityChernoff boundlog-likelihood ratio test

Mathematics Subject Classification ID

Applications of statistics (62P99) Cryptography (94A60)

Cites Work

• Cube Attacks on Tweakable Black Box Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher Order Derivatives and Differential Cryptanalysis
• Title not available (Why is that?)
• Differential cryptanalysis of DES-like cryptosystems
• Title not available (Why is that?)
• Probability and Computing
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• On probability of success in linear and differential cryptanalysis
• 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 \(\chi^2\) statistics
• On the Distribution of Linear Biases: Three Instructive Examples
• Another look at normal approximations in cryptanalysis
• 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
• Multidimensional Extension of Matsui’s Algorithm 2
• The Independence of Linear Approximations in Symmetric Cryptanalysis
• Title not available (Why is that?)
• Distinguishing distributions using Chernoff information
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• How Far Can We Go Beyond Linear Cryptanalysis?
• Optimal key ranking procedures in a statistical cryptanalysis.
• Multidimensional Linear Cryptanalysis of Reduced Round Serpent
• Title not available (Why is that?)
• Multidimensional linear distinguishing attacks and Boolean functions
• Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
• The improbable differential attack: cryptanalysis of reduced round CLEFIA
• Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
• Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
• The Complexity of Distinguishing Distributions (Invited Talk)

Cited In (12)

• 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
• Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
• Another look at normal approximations in cryptanalysis
• Improved truncated differential distinguishers of AES with concrete S-box
• Upper estimates of imbalance of bilinear approximations for round functions of block ciphers
• Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
• Towards closing the security gap of Tweak-aNd-Tweak (TNT)
• Lower bounds on the degree of block ciphers
• How much data may be safely processed on one key in different modes?
• On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
• Accurate estimates of the data complexity and success probability for various cryptanalyses

This page was built for publication: Rigorous upper bounds on data complexities of block cipher cryptanalysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676236)