A weak cipher that generates the symmetric group

DOI10.1007/BF00195210zbMath0794.94014OpenAlexW2065542532WikidataQ121267273 ScholiaQ121267273MaRDI QIDQ1324759

Kenneth G. Paterson, Sean Murphy, Peter R. Wild

Publication date: 11 September 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00195210

zbMATH Keywords

block cipherpermutation groupround functions

Mathematics Subject Classification ID

Cryptography (94A60) Permutation groups (20B99)

Related Items (7)

The \(t\)-wise independence of substitution-permutation networks ⋮ Projective aspects of the AES inversion ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ The group generated by the round functions of a GOST-like cipher ⋮ Primitivity of the group of a cipher involving the action of the key-schedule ⋮ A note on some algebraic trapdoors for block ciphers ⋮ Group theoretic properties of Rijndael-like ciphers

Cites Work

• Unnamed Item
• Algebraic properties of cryptosystem PGM
• DES-like functions can generate the alternating group
• Generators for Certain Alternating Groups with Applications to Cryptography

This page was built for publication: A weak cipher that generates the symmetric group