Generators for Certain Alternating Groups with Applications to Cryptography
From MaRDI portal
Publication:4100258
Cited in
(22)- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- On invariant subspaces in the Lai-Massey scheme and a primitivity reduction
- The \(t\)-wise independence of substitution-permutation networks
- A note on some algebraic trapdoors for block ciphers
- Compositions and parities of complete mappings and of orthomorphisms
- A weak cipher that generates the symmetric group
- Wave-shaped round functions and primitive groups
- Nondegenerate functions and permutations
- An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
- Majority-based reversible logic gates
- Some group-theoretical results on Feistel networks in a long-key scenario
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- Primitivity of the group of a cipher involving the action of the key-schedule
- Primitivity of PRESENT and other lightweight ciphers
- Simple permutations mix well
- Type-preserving matrices and security of block ciphers
- On properties of translation groups in the affine general linear group with applications to cryptography
- Analytical characteristics of the DES
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
- The group generated by the round functions of a GOST-like cipher
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- Space-optimal quasi-Gray codes with logarithmic read complexity
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)
