The one-round functions of the DES generate the alternating group

Authors:
Ralph Wernsdorf
Affiliations:
SIT Gesellschaft für Systeme der Informationstechnik mbH, Grünheide, Germany
Venue:
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Year:
1992

Citing 6
Cited 6

DES has no per round linear factors

Proceedings of CRYPTO 84 on Advances in cryptology
Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys

IEEE Transactions on Software Engineering - Special issue on computer security and privacy
Cryptanalysis of DES with a reduced number of rounds

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Is the data encryption standard a group? (Results of cycling experiments on DES)

Journal of Cryptology
Permutation generators of alternating groups

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Fast recognition of doubly transitive groups

Journal of Symbolic Computation - Special issue on computational group theory: part 2

Markov ciphers and alternating groups

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Guesswork and Variation Distance as Measures of Cipher Security

SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
The Round Functions of RIJNDAEL Generate the Alternating Group

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Group theoretic properties of Rijndael-like ciphers

Discrete Applied Mathematics
Combinatorial properties of basic encryption operations

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In each of the 16 DES rounds we have a permutation of 64-bitblocks. According to the corresponding key-block there are 248 possible permutations per round. In this paper we will prove that these permutations generate the alternating group. The main parts of the paper are the proof that the generated group is 3-transitive, and the application of a result from p. J. Cameron based on the classification of finite simple groups. A corollary concerning n-round functions generalizes the result.