On the primitivity of the AES key-schedule

No abstract is available for this paper.

• Publication year

  2021

• Venue

  arXiv.org

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Some group-theoretical results on Feistel Networks in a long-key scenario

  2019cited by this paper
• PERMUTATION GROUPS

  2019cited by this paper
• Primitivity of the group of a cipher involving the action of the key-schedule

  2018cited by this paper
• Wave-shaped round functions and primitive groups

  2017cited by this paper
• Partition-Based Trapdoor Ciphers

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

  2017cited by this paper
• Making the Impossible Possible

  2017cited by this paper
• On the primitivity of PRESENT and other lightweight ciphers

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

  2015cited by this paper
• The group generated by the round functions of a GOST-like cipher

  2015cited by this paper
• The round functions of KASUMI generate the alternating group

  2015cited by this paper
• UNIVERSITÀ DEGLI STUDI DI MILANO-BICOCCA

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

  2011cited by this paper
• Improved Impossible Differential Cryptanalysis of 7-Round AES-128

  2010cited by this paper
• A Statistical Saturation Attack against the Block Cipher PRESENT

  2009cited by this paper
• Related-Key Cryptanalysis of the Full AES-192 and AES-256

  2009cited by this paper
• On some block ciphers and imprimitive groups

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

  2008cited by this paper
• The Design of Rijndael

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

  1999cited by this paper
• Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems

  1998influential reference
• Differentially Uniform Mappings for Cryptography

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

  1992cited by this paper
• Sur les substitutions orthogonales et les divisions régulières de l'espace

  year unknowncited by this paper

• No citing papers are available for this paper.