Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems

DOI10.1007/S10559-018-0009-0zbMath1481.94080OpenAlexW2790311721MaRDI QIDQ1745698

A. N. Alekseychuk

Publication date: 18 April 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0009-0

zbMATH Keywords

block cipherdata complexitystream ciphersymmetric cryptographycorrelation attackFano's inequalitystatistical attackstatistical hypotheses testing

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Cryptography (94A60)

Cites Work

• Differential cryptanalysis of DES-like cryptosystems
• Rigorous upper bounds on data complexities of block cipher cryptanalysis
• Decorrelation: a theory for block cipher security
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
• Protecting Against Multidimensional Linear and Truncated Differential Cryptanalysis by Decorrelation
• Fast Correlation Attacks: Methods and Countermeasures
• Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
• Multidimensional Linear Cryptanalysis of Reduced Round Serpent
• Markov Ciphers and Differential Cryptanalysis
• Advances in Cryptology – CRYPTO 2004
• Linear Cryptanalysis of Non Binary Ciphers
• How Far Can We Go Beyond Linear Cryptanalysis?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems