Algebraic aspects of the advanced encryption standard

Algebraic Aspects of the Advanced Encryption Standard

Volumn , Issue , 2006, Pages 1-145

  Cid, Carlos ^a   Murphy, Sean ^a   Robshaw, Matthew ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b France Telecom Research and Development   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84895289942     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-36842-9     Document Type: Book

References (120)

1. K. Aoki and S. Vaudenay. On the Use of GF-Inversion as a Cryptographic Primitive. In M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography (SAC) 2003, volume 3006 of LNCS, pages 234-347. Springer-Verlag, 2004.
2. F. Armknecht and S. Lucks. Linearity of the AES Key Schedule. In H. Dob-bertin, V. Rijmen, and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 145-162. Springer-Verlag, 2005.
3. G. Ars. Applications des Bases de Grobner a la Cryptographic PhD thesis, Universite de Rennes I, 2005.
4. G. Ars, .I-C. Faugere, H. Imai, M. Kawazoe, and M. Sugita. Comparison Between XL and Grobner Basis Algorithms. In Pil .loong Lee, editor, Advances in Cryptology-ASIACRYPT 2004, volume 3329 of LNCS, pages 338-353. Springer-Verlag, 2004.
5. M. Bardet. On the Complexity of a Grobner Basis Algorithm. Algorithms Seminar 2002-2004, INRIA, 2005. http://algo.inria.fr/seminars.
6. 2-Technical Report 5049, INRIA, 2003. http://www.inria.fr/rrrt/rr- 5049.html.
7. E. Barkan and E. Biham. In How Many Ways Can You Write Rijndael? In Y. Zheng, editor, Advances in Cryptology-ASIACRYPT 2002, volume 2501 of LNCS, pages 160-175. Springer-Verlag, 2002.
8. E. Barkan and E. Biham. The Book of Rijndaels. Cryptology ePrint Archive 2002/158, 2002. http://eprint.iacr.org/2002/158/.
9. E. Biham, R.J. Anderson, and L.R. Knudsen. SERPENT: A New Block Cipher Proposal. In S. Vaudenay, editor, Fast Software Encryption 1998, volume 1372 of LNCS, pages 222-238. Springer-Verlag, 1998.
10. E. Biham and A. Shamir. Differential Cryptanalysis of DES-like Cryptosys-tems. Journal of Cryptology, 4:3-72, 1993.
11. E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, 1993.
12. A. Biryukov, C. De Canniere, A. Bracken, and B. Preneel. A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. In E. Biham, editor, Advances in Cryptology-EUROCRYPT 2003, volume 2656 of LNCS, pages 33-50. Springer-Verlag, 2003.
13. B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restk-lassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Univer-sitat Innsbruck, 1965.
14. J. Buchmann, A. Pychkine, and R-P. Weinmann. A Zero-dimensional Grobner Basis for AES-128. In M.J.B. Robshaw, editor, Fast Software Encryption 2006, volume 4047 of LNCS. Springer-Verlag, 2006.
15. K.W. Campbell and M.J. Wiener. DES is Not a Group. In E.F. Brickell, editor, Advances in Cryptology-CRYPTO '92, volume 740 of LNCS, pages 512-520. Springer-Verlag, 1993.
16. D. Chaum and J-H. Evertse. Cryptanalysis of DES with a Reduced Number of Rounds. In H.C. Williams, editor, Advances in Cryptology-CRYPTO '85, volume 218 of LNCS, pages 192-211. Springer-Verlag, 1986.
17. J-M. Chen, N. Courtois, and B-Y. Yang. On Asymptotic Security Estimates in XL and Grobner Bases-Related Algebraic Cryptanalysis. In J. Lopez, S. Qing, and E. Okhamoto, editors, ICICS, volume 3269 of LNCS, pages 401-413. Springer-Verlag, 2004.
18. J-M. Chen and B-Y. Yang. All in the XL Family: Theory and Practice. In C. Park and S. Chee, editors, Proceedings of the 7th Lnternational Conference on Information Security and Cryptology, volume 3506 of LNCS, pages 67-86. Springer-Verlag, 2004.
19. J-M. Chen and B-Y. Yang. Theoretical Analysis of XL over Small Fields. In H. Wang, J. Piepryzk, and V. Varadharajan, editors, Proceedings of the 9th Australasian Conference on Information Security and Privacy, volume 3108 of LNCS, pages 277-288. Springer-Verlag, 2004.
20. C. Cid and G. Leurent. An Analysis of the XSL Algorithm. In B. Roy, editor, Advances in Cryptology-ASIACRYPT 2005, volume 3788 of LNCS, pages 333-352. Springer-Verlag, 2005.
21. C. Cid, S. Murphy, and M.J.B. Robshaw. An Algebraic Framework for Cipher Embeddings. In N.P. Smart, editor, 10th IMA International Conference on Coding and Cryptography, volume 3796 of LNCS, pages 278-289. Springer-Verlag, 2005.
22. C. Cid, S. Murphy, and M.J.B. Robshaw. Small Scale Variants of the AES. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption 2005, volume 3557 of LNCS, pages 145-162. Springer-Verlag, 2005.
23. P. Cohn. Classical Algebra. John Wiley, 2000.
24. D. Coppersmith. The Real Reason for Rivest's Phenomenon. In H.C. Williams, editor, Advances in Cryptology-CRYPTO '85, volume 218 of LNCS, pages 535-536. Springer-Verlag, 1986.
25. D. Coppersmith. The Data Encryption Standard (DES) and its Strength Against Attacks. Research Report RC 18613, IBM, 1992.
26. fc): Applications to HFE Challenge 2 and Sflash-v2. In F. Bao, R. Deng, and J. Zhou, editor, Public Key Cryptography-PKC 2004, volume 2947 of LNCS, pages 201-217. Springer-Verlag, 2004.
27. N. Courtois. The Inverse S-Box, Non-linear Polynomial Relations and Crypt-analysis of Block Ciphers. In V. Rijmen H. Dobbertin and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 234-347. Springer-Verlag, 2005.
28. N. Courtois, A. Klimov, J. Patarin, and A. Shamir. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. In B. Pre-neel, editor, Advances in Cryptology-EUROCRYPT 2000, volume 1807 of LNCS, pages 392-407. Springer-Verlag, 2000.
29. N. Courtois and W. Meier. Algebraic Attacks on Stream Ciphers with Linear Feedback. In E. Biham, editor, Advances in Cryptology-EUROCRYPT 2003, volume 2656 of LNCS, pages 345-359. Springer-Verlag, 2003.
30. N. Courtois and J. Patarin. About the XL Algorithm over GF(2). In M. Joye, editor, Progress in Cryptology-CT-RSA 2003, pages 140-156. Springer-Verlag, 2003.
31. N. Courtois and J. Piepryzk. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. Cryptology ePrint Archive 2002/044, 2002. http://eprint.iacr.org/2002/044/.
32. N. Courtois and J. Piepryzk. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In Y. Zheng, editor, Advances in Cryptology-ASIACRYPT 2002, volume 2501 of LNCS, pages 267-287. Springer-Verlag, 2002.
33. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer-Verlag, second edition, 1997.
34. D. Cox, I. Little, and D. O'Shea. Using Algebraic Geometry, volume 185 of Graduate Texts in Mathematics. Springer, second edition, 2004.
35. J. Daemen. Cipher and Hash Function Design Strategies based on Linear and Differential Cryptanalysis. PhD thesis, Katholieke Universiteit Leuven, 1995.
36. J. Daemen, L.R. Knudsen, and V. Rijmen. The Block Cipher SQUARE. In E. Biham, editor, Fast Software Encryption 1997, volume 1267 of LNCS, pages 149-165. Springer-Verlag, 1997.
37. J. Daemen and V. Rijmen. Rijndael. Submission to NIST AES Process, 1997. http://csrc.nist.gov/CryptoToolkit/aes/.
38. J. Daemen and V. Rijmen. Answer to "New Observations on Rijndael". Submission to NIST AES Process, 2000. http://csrc.nist.gov/ CryptoToolkit/aes/.
39. J. Daemen and V. Rijmen. The Design of Rijndael. Springer-Verlag, 2002.
40. Y. Desmedt, T.V. Le, M. Marrotte, and J-J. Quisquater. Algebraic Structures and Cycling Test of Rijndael, 2001. http://citeseer.ist.psu.edu/ desmedt02algebraic.html.
41. C. Diem. The XL-Algorithm and a Conjecture from Commutative Algebra. In P.J. Lee, editor, Advances in Cryptology-ASIACRYPT 2004, volume 3329 of LAICS', pages 323-337. Springer-Verlag, 2004.
42. H. Dobbertin, L.R. Knudsen, and M.J.B. Robshaw. The Cryptanalysis of the AES-A Brief Survey. In H. Dobbertin, V. Rijmen, and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 1-10. Springer-Verlag, 2005.
43. ECRYPT. The State of the Art of AES Cryptanalysis. Technical Report, ECRYPT Network of Excellence, 2005. http://wuw.ecrypt.eu.org.
44. ECRYPT. AES Lounge. Website, ECRYPT Network of Excellence, 2006. http://www.iaik.tu-graz.ac.at/research/krypto/AES/.
45. J-H. Evertse. Cryptanalysis of DES with a Reduced Number of Rounds. In D. Chaum and W.L. Price, editors, Advances in Cryptology-EUROCRYPT 87, volume 304 of LNCS, pages 249-266. Springer-Verlag, 1988.
46. J-C. Faugere. A New Efficient Algorithm for Computing Grobner bases (F4). Journal of Pure and Applied Algebra, 139:61-88, 1999.
47. J-C. Faugere. A New Efficient Algorithm for Computing Grobner Bases without Reduction to Zero (F5). In T. Mora, editor, International Symposium on Symbolic and Algebraic Computation-ISSAC 2002, pages 75-83, 2002.
48. J-C. Faugere, P. Gianni, D. Lazard, and T. Mora. Efficient Computation of Zero-dimensional Grobner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4):329-344, 1993.
49. J-C. Faugere and A. Joux. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems using Grobner Bases. In D. Boneh, editor, Advances in Cryptology-CRYPTO 2003, volume 2729 of LNCS, pages 44-60. Springer-Verlag, 2003.
50. H. Feistel. Cryptography and Computer Piracy. Scientific American, 228:15-23, 1973.
51. N. Ferguson, J. Kelsey, B. Schneier, M. Stay, D. Wagner, and D. Whiting. Improved Cryptanalysis of Rijndael. In B. Schneier, editor, Fast Software Encryption 2000, volume 1978 of LNCS, pages 213-230. Springer-Verlag, 2000.
52. N. Ferguson, R. Schroeppel, and D. Whiting. A Simple Algebraic Representation of Rijndael. In S. Vaudenay and A. Youssef, editors, Selected Areas in Cryptography (SAC) 2001, volume 2259 of LNCS, pages 103-111. Springer-Verlag, 2001.
53. J. Fuller and W. Millan. Linear Redundancy in S-Boxes. In T. Johansson, editor, Fast Software Encryption 2003, volume 2887 of LNCS, pages 74-86. Springer-Verlag, 2003.
54. M.R. Garey and D.S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
55. H. Gilbert and M. Minier. A Collision Attack on 7 Rounds of Rijndael. In Proceedings of Third Advanced Encryption Standard Conference, pages 230-241. National Institute of Standards and Technology, 2000.
56. M. Hellman, R. Merkle, R. Schroeppel, L. Washington, W. Dime, S. Pohlig, and P. Schweitzer. Results of an Initial Attempt to Cryptanalyse the NBS Data Encryption Standard. Technical Report 76-042, Stanford University Electronics Laboratories, 1976.
57. I.N. Herstein. Topics in Algebra. John Wiley & Sons, Second edition, 1975.
58. J.W.P. Hirschfeld. Projective Geometry over Finite Fields. Oxford Mathematical Monographs. Oxford University Press, 1998.
59. K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, Second edition, 1971.
60. G. Hornauer, W. Stephan, and R. Wernsdorf. Markov Ciphers and Alternating Groups. In T. Helleseth, editor, Advances in Cryptology-EUROCRYPT '93, volume 765 of LNCS, pages 453-460. Springer-Verlag, 1994.
61. W-A. Jackson and S. Murphy. Projective Aspects of the AES Inversion. Technical Report RHUL-MA-2006-4, Royal Holloway, University of London, 2005. http://www.ma.rhul.ac.uk/techreport s/.
62. T. Jakobsen and L. Knudsen. Attacks on Block Ciphers of Low Algebraic Degree. Journal of Cryptology, 14:197-210, 2001.
63. T. Jakobsen and L.R. Knudsen. The Interpolation Attack on Block Ciphers. In E. Biham, editor, Fast Software Encryption 1997, volume 1267 of LNCS, pages 28-40. Springer-Verlag, 1997.
64. D. Kahn. Seizing the Enigma. Arrow Books, 1996.
65. B.S. Kaliski, R. Rivest, and A.T. Sherman. Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES). Journal of Cryptology, 1:3-36, 1988.
66. M. Kalkbrener. Solving Systems of Algebraic Equations by Using Grobner Bases. In J.H. Davenport, editor, EUROCAL'87, volume 378 of LNCS, pages 282-291. Springer-Verlag, 1989.
67. L. Knudsen and H. Raddum. Recommendation to NIST for the AES. Submission to NIST AES Process, 2000. http://csrc.nist.gov/CryptoToolkit/aes/.
68. X. Lai, J.L. Massey, and S. Murphy. Markov Ciphers and Differential Crypt-analysis. In D.W. Davies, editor, Advances in Cryptology-EUROCRYPT 91, volume 547 of LNC'S, pages 17-38. Springer-Verlag, 1991.
69. S. Landau. Communications Security for the Twenty-First Century: The Advanced Encryption Standard. Notices of the American Mathematical Society, 47:450-459, 2000.
70. S. Landau. Standing the Test of Time: The Data Encryption Standard. Notices of the American Mathematical Society, 47:341-349, 2000.
71. S. Landau. Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard. American Mathematical Monthly, 111:89-117, 2004.
72. D. Lazard. Grobner Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations. In J.A. van Hulzen, editor, Proceedings of the European Computer Algebra Conference on Computer Algebra, volume 162 of LNCS, pages 146-156. Springer-Verlag, 1983.
73. T. Van Lee, R. Sparr, R. Wernsdorf, and Y. Desmedt. Complementation-like and Cyclic Properties of AES Round Functions. In H. Dobbertin, V. Rijmen, and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 128-141. Springer-Verlag, 2005.
74. R. Lidl and H. Niederreiter. Introduction to Finite Fields and their Applications. Cambridge University Press, Revised edition, 1994.
75. D. Mackenzie. A Game of Chance. New Scientist, 2398:36-39, 2003. 7 June 2003.
76. F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland Publishing Company, 1978.
77. MAGMA v2.12. Computational Algebra Group, School of Mathematics and Statistics, University of Sydney, 2005. http://magma.maths.usyd.edu.au.
78. M. Matsui. Linear Cryptanalysis Method for DES Cipher. In T. Helleseth, editor, Advances in Cryptology-EUROCRYPT '93, volume 765 of LNCS, pages 386-397. Springer-Verlag, 1994.
79. E.W. Mayr. Some Complexity R.esults for Polynomial Ideals. Journal of Complexity, 13(3):303-325, 1997.
80. A.J. Menezes, P.C. Van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
81. T. Moh. On the Method of XL and its Inefficiency against TTM. Cryptology ePrint Archive 2001/047, 2001. http://eprint.iacr.org/2001/047/.
82. J. Monnerat and S. Vaudenay. On some Weak Extensions of AES and BES. In J. Lopez, S. Qinq, and E. Okhamoto, editors, Sixth International Conference on Information and Communications Security, volume 3269 of LNCS, pages 414-426. Springer-Verlag, 2004.
83. J.H. Moore and G.J. Simmons. Cycle Structures of the DES with Weak and Semi-Weak Keys. In A.M. Odlyzko, editor, Advances in Cryptology-CRYPTO '86, volume 263 of LNCS, pages 9-32. Springer-Verlag, 1987.
84. S. Murphy. An Analysis of SAFER. Journal of Cryptology, 11:235-251, 1998.
85. S. Murphy, K.G. Paterson, and P. Wild. A Weak Cipher that Generates the Symmetric Group. Journal of Cryptology, 7:61-65, 1994.
86. S. Murphy, F. Piper, M. Walker, and P. Wild. Maximum Likelihood Estimation for Block Cipher Keys. Technical Report RHUL-MA-2006-3, Royal Holloway, University of London, 1994. http://www.ma.rhul.ac.uk/techreports/.
87. S. Murphy and M.J.B. Robshaw. Further Comments on the Structure of Ri-jndael. Submission to NIST AES Process, 2000. http://csrc.nist.gov/ CryptoToolkit/aes/.
88. S. Murphy and M.J.B. Robshaw. New Observations on Rijndael. Submission to NIST AES Process, 2000. http://csrc.nist.gov/CryptoToolkit/aes/.
89. S. Murphy and M.J.B. Robshaw. Essential Algebraic Structure Within the AES. In M. Yung, editor, Advances in Cryptology-CRYPTO 2002, volume 2442 of LNCS, pages 1-16. Springer-Verlag, 2002.
90. S. Murphy and M.J.B. Robshaw. Comments on the Security of the AES and the XSL Technique. Electronic Letters, 39:26-38, 2003.
91. M.A. Musa, E.F. Schaefer, and S. Wedig. A Simplified AES Algorithm and its Linear and Differential Cryptanalysis. Cryptologia, XXVII (2):148-177, 2003.
92. National Bureau of Standards. The Data Encryption Standard. Federal Information Processing Standards Publication (FIPS) 46, 1977.
93. National Institute of Standards and Technology. The Digital Signature Standard. Federal Information Processing Standards Publication (FIPS) 186, 1994.
94. National Institute of Standards and Technology. Announcing the Development of a Federal Information Processing Standard for Advanced Encryption Standard, 1997.
95. National Institute of Standards and Technology. The Advanced Encryption Standard. Federal Information Processing Standards Publication (FIPS) 197, 2001.
96. National Institute of Standards and Technology. Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher. Special Publication SP800-67, 2004.
97. C.W. Norman. Undergraduate Algebra. Oxford University Press, 1986.
98. K. Nyberg. Differentially Uniform Mappings for Cryptography. In T. Helle-seth, editor, Advances in Cryptology-EUROCRYPT '93, volume 765 of LNCS, pages 55-64. Springer-Verlag, 1994.
99. K. Nyberg and L.R. Knudsen. Provable Security Against a Differential Attack. Journal of Cryptology, 8(l):27-38, 1995.
100. J. Patarin. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In U. Maurer, editor, Advances in Cryptology-EUROCRYPT '96, volume 1070 of LNCS, pages 33-48. Spinger-Verlag, 1996.
101. K.G. Paterson. Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers. In L.R. Knudsen, editor, Fast Software Encryption 1999, volume 1636 of LNCS, pages 201-214. Springer-Verlag, 1999.
102. R.C.-W. Phan. Mini Advanced Encryption Standard (Mini-AES): A Testbed for Cryptanalysis Students. Cryptologia, XXVI (4):283-306, 2002.
103. J-J. Quisquater and J-P. Delescaille. How Easy is Collision Search? Application to DES. In J-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology-EUROCRYPT '89, volume 434 of LNCS, pages 429-434. Springer-Verlag, 1990.
104. J-J. Quisquater and J-P. Delescaille. How Easy is Collision Search? New Results and Applications to DES. In G. Brassard, editor, Advances in Cryptology-CRYPTO '89, volume 435 of LNCS, pages 408-413. Springer-Verlag, 1990.
105. H. Raddum. More Dual Rijndaels. In H. Dobbertin, V. Rijmen, and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 142-147. Springer-Verlag, 2005.
106. J.A. Reeds and J.L. Manfredelli. DES has no Per Round Linear Factors. In G.R Blakely and D. Chaum, editors, Advances in Cryptology-Proceedings of CRYPTO 84, volume 196 of LNCS, pages 377-389. Springer-Verlag, 1985.
107. V. Rijmen. Cryptanalysis and Design of Iterated Block Ciphers. PhD thesis, Katholieke Universiteit Leuven, 1997.
108. V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win. The Cipher SHARK. In D. Gollman, editor, Fast Software Encryption 1996, volume 1039 of LNCS, pages 99-112. Springer-Verlag, 1996.
109. I. Schaumueller-Bichl. Cryptanalysis of the Data Encryption Standard by the Method of Formal Coding. In T. Beth, editor, Proceedings of Workshop on Cryptography, Berg Fuerstein, Germany 1982 (EUROCRYPT 82), volume 143 of LNCS, pages 235-255. Springer-Verlag, 1983.
110. B. Schneier. AES News. Crypto-Gram Newsletter, September 2002. http://www.schneier.com/crypto-gram-0209.html.
111. R. Schroeppel. Second Round Comments to NIST. Submission to NIST AES Process, 1999. http://csrc.nist.gov/CryptoToolkit/aes/.
112. C. Seife. Crucial Cipher Flawed, Cryptographers Claim. Science, 297:2193, 2002. 27 September 2002.
113. C.E.Shannon. Communication Theory of Secrecy Systems. Bell System Technical Journal, 28-4:656-715, 1949.
114. T. Shimoyama and T. Kaneko. Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES. In H. Krawczyk, editor, Advances in Cryptology-CRYPTO '98, volume 1462 of LNCS, pages 200-211. Springer-Verlag, 1998.
115. A. Steel. Computing Grobner Bases with Linear Algebra. Algebraic Geometry and Number Theory with MAGMA, Institute Henri Poincare, Paris, 2004.
116. I. Toli and A. Zanoni. An Algebraic Interpretation of AES-128. In H. Dob-bertin, V. Rijmen, and A. Sowa, editors, Advanced Encryption Standard-AES, Fourth International Conference, volume 3373 of LNCS, pages 84-97. Springer-Verlag, 2005.
117. D. Wagner. Towards a Unifying View of Block Cipher Cryptanalysis. In B. Roy and W. Meier, editors, Fast Software Encryption 2004, volume 3017 of LNCS, pages 16-33. Springer-Verlag, 2004.
118. R. Wernsdorf. The One-Round Functions of the DES Generate the Alternating Group. In R.A. Rueppel, editor, Advances in Cryptology-EUROCRYPT 1992, volume 658 of LNCS, pages 99-112. Springer-Verlag, 1993.
119. R. Wernsdorf. The Round Functions of RI.INDAEL Generate the Alternating Group. In J. Daemen and V. Rijmen, editors, Fast Software Encryption 2002, volume 2365 of LNCS, pages 143-148. Springer-Verlag, 2002.
120. A.M. Youssef and S.E. Tavares. Affine Equivalence in the AES Round Function. Discrete Applied Mathematics, 148(2):161-170, 2005.