Generators for Certain Alternating Groups with Applications to Cryptography

DOI10.1137/0129051zbMATH Open0333.20002OpenAlexW1971498088MaRDI QIDQ4100258FDOQ4100258

Edna K. Grossman, Don Coppersmith

Publication date: 1975

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0129051

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)

Cited In (22)

• A weak cipher that generates the symmetric group
• Wave-shaped round functions and primitive groups
• A note on some algebraic trapdoors for block ciphers
• Type-preserving matrices and security of block ciphers
• Primitivity of the group of a cipher involving the action of the key-schedule
• On the group generated by the round functions of translation based ciphers over arbitrary finite fields
• Simple permutations mix well
• The \(t\)-wise independence of substitution-permutation networks
• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Analytical Characteristics of the DES
• Primitivity of PRESENT and other lightweight ciphers
• On invariant subspaces in the Lai-Massey scheme and a primitivity reduction
• Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
• 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
• Compositions and parities of complete mappings and of orthomorphisms
• On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
• An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
• The group generated by the round functions of a GOST-like cipher
• Majority-based reversible logic gates
• Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
• Nondegenerate functions and permutations

This page was built for publication: Generators for Certain Alternating Groups with Applications to Cryptography

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