Improving the upper bound on the maximum average linear hull probability for Rijndael

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 112-128

  Keliher, Liam ^a   Meijer, Henk ^a   Tavares, Stafford ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

AES; Linear cryptanalysis; Maximum average linear hull probability; Provable security; Rijndael

Indexed keywords

PROBABILITY DISTRIBUTIONS;

DATA COMPLEXITY; LINEAR CRYPTANALYSIS; LOWER BOUNDS; MAXIMUM AVERAGE LINEAR HULL PROBABILITY; PROVABLE SECURITY; RIJNDAEL; UPPER BOUND;

CRYPTOGRAPHY;

EID: 84949188599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_9     Document Type: Conference Paper

References (23)

1. C.M. Adams, A formal and practical design procedure for substitution-permutation network cryptosystems, Ph.D. Thesis, Queen’s University, Kingston, Canada, 1990.
2. K. Aoki and K. Ohta, Strict evaluation of the maximum average of differential probability and the maximum average of linear probability, IEICE Trans. Fundamentals, Vol. E80-A, No. 1, January 1997.
3. E. Biham, On Matsui’s linear cryptanalysis, Advances in Cryptology— EUROCRYPT’94, LNCS 950, Springer-Verlag, pp. 341-355, 1995.
4. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, pp. 3-72, 1991.
5. J. Daemen, R. Govaerts, and J. Vandewalle, Correlation matrices, Fast Software Encryption: Second International Workshop, LNCS 1008, Springer-Verlag, pp. 275-285, 1995.
6. J. Daemen and V. Rijmen, AESpr oposal: Rijndael, http://csrc.nist.gov/encryption/aes/rijndael/Rijndael.pdf.
7. J. Daemen and V. Rijmen, AES(R ijndael) reference code in ANSI C, http://csrc.nist.gov/encryption/aes/rijndael/.
8. Data Encryption Standard (DES), National Bureau of Standards FIPS Publication 46, 1977.
9. H. Feistel, Cryptography and computer privacy, Scientific American, Vol. 228, No. 5, pp. 15-23, May 1973.
10. H. Feistel, W.A. Notz, and J.L. Smith, Some cryptographic techniques for machine to machine data communications, Proceedings of the IEEE, Vol. 63, No. 11, pp. 1545-1554, November 1975.
11. C. Harpes, G. Kramer, and J. Massey, A generalization of linear cryptanalysis and the applicability of Matsui’s piling-up lemma, Advances in Cryptology— EUROCRYPT’95, LNCS 921, Springer-Verlag, pp. 24-38, 1995.
12. H.M. Heys and S.E. Tavares, Substitution-permutation networks resistant to differential and linear cryptanalysis, Journal of Cryptology, Vol. 9, No. 1, pp. 1-19, 1996.
13. S. Hong, S. Lee, J. Lim, J. Sung, and D. Cheon, Provable security against differential and linear cryptanalysis for the SPN structure, Fast Software Encryption (FSE 2000), LNCS 1978, Springer-Verlag, pp. 273-283, 2001.
14. L. Keliher, H. Meijer, and S. Tavares, Modeling linear characteristics of substitution-permutation networks, Sixth Annual International Workshop on Selected Areas in Cryptography (SAC’99), LNCS 1758, Springer-Verlag, pp. 78-91, 2000.
15. L. Keliher, H. Meijer, and S. Tavares, New method for upper bounding the maximum average linear hull probability for SPNs, Advances in Cryptology— EUROCRYPT 2001, LNCS 2045, Springer-Verlag, pp. 420-436, 2001.
16. L.R. Knudsen, Practically secure Feistel ciphers, Fast Software Encryption, LNCS 809, Springer-Verlag, pp. 211-221, 1994.
17. X. Lai, J. Massey, and S. Murphy, Markov ciphers and differential cryptanalysis, Advances in Cryptology—EUROCRYPT’91, LNCS 547, Springer-Verlag, pp. 17-38, 1991.
18. M. Matsui, Linear cryptanalysis method for DEScipher, Advances in Cryptology— EUROCRYPT’93, LNCS 765, Springer-Verlag, pp. 386-397, 1994.
19. M. Matsui, On correlation between the order of s-boxes and the strength of DES, Advances in Cryptology—EUROCRYPT’94, LNCS 950, Springer-Verlag, pp. 366-375, 1995.
20. W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology—EUROCRYPT’89, LNCS 434, Springer-Verlag, pp. 549-562, 1990.
21. K. Nyberg, Linear approximation of block ciphers, Advances in Cryptology— EUROCRYPT’94, LNCS 950, LNCS 950, Springer-Verlag, pp. 439-444, 1995.
22. C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, no. 4, pp. 656-715, 1949.
23. S. Vaudenay, On the security of CS-Cipher, Fast Software Encryption (FSE’99), LNCS 1636, Springer-Verlag, pp. 260-274, 1999.