Can a differential attack work for an arbitrarily large number of rounds?

DOI10.1007/978-3-030-68890-5_9MaRDI QIDQ831646zbMATH OpenOpenAlexFDO

Authors Nicolas Courtois, Jean-Jacques Quisquater

Publication date 24 March 2022

Full work available at URL https://discovery.ucl.ac.uk/id/eprint/10133641/

zbMATH Keywords

algebraic cryptanalysisBoolean functionsmultivariate polynomialspolynomial invariantsannihilatorsFeistel ciphersgeneralized linear cryptanalysishidden polynomial problemsk-normalityMarkov ciphersT-310

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 708833 (Why is no real title available?)
• scientific article; zbMATH DE number 1455087 (Why is no real title available?)
• scientific article; zbMATH DE number 1455090 (Why is no real title available?)
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
• A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
• Advanced Encryption Standard – AES
• Advanced truncated differential attacks against GOST block cipher and its variants
• Advances in Cryptology – CRYPTO 2004
• Aggregated differentials and cryptanalysis of PP-1 and GOST
• Algebraic and Slide Attacks on KeeLoq
• Algebraic, AIDA/Cube and side channel analysis of KATAN family of block ciphers
• An improved differential attack on full GOST
• Comparison of Cube Attacks Over Different Vector Spaces
• Contradiction immunity and guess-then-determine attacks on GOST
• Cryptanalytic attacks on MIFARE classic protocol
• Differential cryptanalysis of DES-like cryptosystems
• Markov Ciphers and Differential Cryptanalysis
• Non-linear approximations in linear cryptanalysis
• Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
• Normal Boolean functions
• Partitioning cryptanalysis
• Random permutation statistics and an improved slide-determine attack on KeeLoq
• Systematic construction of nonlinear product attacks on block ciphers
• The MALICIOUS framework: embedding backdoors into tweakable block ciphers
• The multiplicative complexity of 6-variable Boolean functions

Cited in

(2)

• On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of enigma
• Rotational analysis of ChaCha permutation

This page was built for publication: Can a differential attack work for an arbitrarily large number of rounds?

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