Invariant Hopping Attacks on Block Ciphers

Block ciphers are in widespread use since the 1970s. Their iterated structure is prone to numerous round invariant attacks for example in Linear Cryptanalysis (LC). The next step is to look at non-linear polynomial invariants cf. Eurocrypt'95. Until recently, researchers have found extremely few such attacks, with some impossibility results. Eventually recent papers show how to construct polynomial invariant attacks for block ciphers, however many such results were of degree 2. In this paper we propose a new incremental methodology for constructing high degree polynomial invariant attacks on block ciphers. A trivial attack on one cipher setup will be transposed to show the existence of a more advanced attack on a stronger cipher in several steps. The key tool is the manipulation of the roots of the so called Fundamental Equation. Examples are constructed with an old historical block cipher T-310.

• Publication year

  2020

• Venue

  arXiv.org

• Publication date

  2020-02-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  arXiv 2002.03212
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Construction of a polynomial invariant annihilation attack of degree 7 for T-310

  2020cited by this paper
• Slide attacks and LC-weak keys in T-310

  2019influential reference
• Systematic Construction of Nonlinear Product Attacks on Block Ciphers

  2019influential reference
• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis

  2019cited by this paper
• Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions

  2018cited by this paper
• On the Existence of Non-Linear Invariants and Algebraic Polynomial Constructive Approach to Backdoors in Block Ciphers

  2018influential reference
• Block Cipher Invariants as Eigenvectors of Correlation Matrices

  2018cited by this paper
• Ciphertext-only attacks and weak long-term keys in T-310

  2018cited by this paper
• Feistel ciphers in East Germany in the communist era

  2018cited by this paper
• Linear cryptanalysis and block cipher design in East Germany in the 1970s

  2018cited by this paper
• Nonlinear Approximations in Cryptanalysis Revisited

  2018cited by this paper
• Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants

  2018cited by this paper
• A note on some algebraic trapdoors for block ciphers

  2017cited by this paper
• Partition-Based Trapdoor Ciphers

  2017cited by this paper
• Proving Resistance Against Invariant Attacks: How to Choose the Round Constants

  2017influential reference
• Cryptographic Security Analysis of T-310

  2017influential reference
• Nonlinear Invariant Attack: Practical Attack on Full SCREAM, iSCREAM, and Midori64

  2016influential reference
• The group generated by the round functions of a GOST-like cipher

  2015cited by this paper
• Malicious Keccak

  2015cited by this paper
• A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro

  2015cited by this paper
• Malicious Hashing: Eve's Variant of SHA-1

  2014cited by this paper
• Four Measures of Nonlinearity

  2013cited by this paper
• A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack

  2011cited by this paper
• Group theoretic properties of Rijndael-like ciphers

  2008cited by this paper
• Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions

  2006cited by this paper
• The East German Encryption Machine T-310 and the Algorithm It Used

  2006cited by this paper
• The Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers

  2004cited by this paper
• Feistel Schemes and Bi-linear Cryptanalysis

  2004cited by this paper
• Algebraic Attacks on Stream Ciphers with Linear Feedback

  2003cited by this paper
• Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers

  1999cited by this paper
• Partitioning Cryptanalysis

  1997cited by this paper
• A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma

  1995cited by this paper
• The One-Round Functions of the DES Generate the Alternating Group

  1992cited by this paper
• The rise of Cayley's invariant theory (1841–1862)

  1986cited by this paper

• On security aspects of the ciphers T-310 and SKS with approved long-term keys

  2023influential citation
• On Closed-Cycle Loops and Applicability of Nonlinear Product Attacks to DES

  2021cites this paper
• On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of Enigma

  2021influential citation
• Construction of a polynomial invariant annihilation attack of degree 7 for T-310

  2020influential citation
• Can a Differential Attack Work for an Arbitrarily Large Number of Rounds?

  2020cites this paper
• Systematic Construction of Nonlinear Product Attacks on Block Ciphers

  2019cites this paper
• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis

  2019cites this paper
• Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions

  2018cites this paper
• On the Existence of Non-Linear Invariants and Algebraic Polynomial Constructive Approach to Backdoors in Block Ciphers

  2018cites this paper