Abstract
For the block cipher RIJNDAEL with a block length of 128 bits group theoretic properties of the round functions are derived. Especially it is shown that these round functions generate the alternating group.
Chapter PDF
Similar content being viewed by others
Keywords
References
Daemen, J. and Rijmen, V.: AES-proposal RIJNDAEL, Version 2, September 8, 1999. Available at http://www.esat.kuleuven.ac.be/~rijmen/rijndael/.
Hornauer, G., Stephan, W., and Wernsdorf, R.: Markov Ciphers and Alternating Groups. In Advances in Cryptology-EUROCRYPT’93, Lecture Notes in Computer Science, vol. 765, Springer 1994, 453–460.
Murphy, S. and Robshaw, M.: New Observations on Rijndael, Preliminary Draft, August 7, 2000.
National Institute of Standards and Technology (U.S.): Advanced Encryption Standard (AES), FIPS Publication 197, November 26, 2001. Available at http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
Paterson, K.G.: Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers. In Fast Software Encryption-FSE’99, Lecture Notes in Computer Science, vol. 1636, Springer 1999, 201–214.
Wernsdorf, R.: The One-Round Functions of the DES Generate the Alternating Group. In Advances in Cryptology-EUROCRYPT’92, Lecture Notes in Computer Science, vol. 658, Springer 1993, 99–112.
Wernsdorf, R.: IDEA, SAFER++ and Their Permutation Groups, Second Open NESSIE Workshop, Royal Holloway University of London, Egham, September 2001.
Wielandt, H.: Finite Permutation Groups. Academic Press, New York and London, 1964.
Zieschang, T.: Combinatorial Properties of Basic Encryption Operations. In Advances in Cryptology-EUROCRYPT’97, Lecture Notes in Computer Science, vol. 1233, Springer 1997, 14–26.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wernsdorf, R. (2002). The Round Functions of RIJNDAEL Generate the Alternating Group. In: Daemen, J., Rijmen, V. (eds) Fast Software Encryption. FSE 2002. Lecture Notes in Computer Science, vol 2365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45661-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-45661-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44009-3
Online ISBN: 978-3-540-45661-2
eBook Packages: Springer Book Archive