1. W. Maier and O. Staffelbach, “Nonlinearity criteria for cryptographic functions,” in Advances in Cryptology, EUROCRYPT’89, Lecture Notes in Computer Science (Springer-Verlag, 1990), Vol. 434, pp. 549–562.
2. A. F. Webster and S. E. Tavares, “On the design of S-boxes,” in Proc. of CRYPTO’85 (Springer-Verlag, 1985).
3. K. Nyberg, “Differentially uniform mappings for cryptography,” in Advances in Cryptology, Proceedings of EUROCRYPT’93, Lecture Notes in Computer Science (Springer-Verlag, Berlin-Heidelberg-New York, 1994), Vol. 765, pp. 55–65.
4. M. I. Mazurkov and A. V. Sokolov, “Cryptographic properties of the nonlinear conversion of Rijndael cipher on the basis of complete classes of irreducible polynomials,” Trudy OPU, No. 2(39), 183 (2012).
5. I. D. Gorbenko, O. V. Potii, and Yu. A. Izbenko, “Analytical and statistical investigations of properties of Boolean functions of the RIJNDAL crypto-algorithm (FIPS 197),” Radiotekhnika (Kharkiv) 126, 132 (2004).