The Round Functions of RIJNDAEL Generate the Alternating Group

DOI10.1007/3-540-45661-9_11zbMath1045.94535OpenAlexW1595033009MaRDI QIDQ3046349

Ralph Wernsdorf

Publication date: 12 August 2004

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45661-9_11

zbMATH Keywords

alternating groupblock cipher Rijndael

Mathematics Subject Classification ID

Cryptography (94A60) Subgroups of symmetric groups (20B35)

Related Items (17)

A note on an infeasible linearization of some block ciphers ⋮ On some block ciphers and imprimitive groups ⋮ On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure ⋮ Projective aspects of the AES inversion ⋮ On groups generated by ciphers based on Feistel network ⋮ Primitivity of PRESENT and other lightweight ciphers ⋮ Type-preserving matrices and security of block ciphers ⋮ Threshold implementations of small S-boxes ⋮ On the group generated by the round functions of translation based ciphers over arbitrary finite fields ⋮ Some group-theoretical results on Feistel networks in a long-key scenario ⋮ On properties of translation groups in the affine general linear group with applications to cryptography ⋮ Wave-shaped round functions and primitive groups ⋮ The round functions of cryptosystem PGM generate the symmetric group ⋮ A note on some algebraic trapdoors for block ciphers ⋮ An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher ⋮ Group theoretic properties of Rijndael-like ciphers ⋮ Group properties of block ciphers of the Russian standards GOST R 34.11-2012 and GOST R 34.12-2015

This page was built for publication: The Round Functions of RIJNDAEL Generate the Alternating Group