New method for upper bounding the maximum average linear hull probability for SPNs

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

Volumn 2045, Issue , 2001, Pages 420-436

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

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Linear cryptanalysis; Maximum average linear hull probability; Provable security; Substitution permutation networks

Indexed keywords

CRYPTOGRAPHY; LINEAR TRANSFORMATIONS; PROBABILITY;

BLOCK SIZES; BRANCH NUMBER; DATA COMPLEXITY; LINEAR CRYPTANALYSIS; LOWER BOUNDS; MAXIMUM AVERAGE LINEAR HULL PROBABILITY; PROVABLE SECURITY; SUBSTITUTION PERMUTATION NETWORK;

MATHEMATICAL TRANSFORMATIONS;

EID: 84945126880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44987-6_26     Document Type: Conference Paper

References (15)

1. E. Biham, On Matsui’s linear cryptanalysis, Advances in Cryptology—EUROCRYPT’94, Springer-Verlag, pp. 341-355, 1995.
2. E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, pp. 3-72, 1991.
3. J. Daemen, R. Govaerts, and J. Vandewalle, Correlation matrices, Fast Software Encryption: Second International Workshop, Springer-Verlag, pp. 275-285, 1995.
4. J. Daemen, L. Knudsen, and V. Rijmen, The block cipher SQUARE, Fast Software Encryption-FSE’97, Springer-Verlag, pp. 149-165, 1997.
5. J. Daemen and V. Rijmen, AES proposal: Rijndael, http://csrc.nist.gov/encryption/aes/round2/AESAlgs/Rijndael/Rijndael.pdf, 1999.
6. H. Feistel, Cryptography and computer privacy, Scientific American, Vol. 228, No. 5, pp. 15-23, May 1973.
7. C. Harpes, G. Kramer, and J. Massey, Agener alization of linear cryptanalysis and the applicability of Matsui’s piling-up lemma, Advances in Cryptology—EUROCRYPT’95, Springer-Verlag, pp. 24-38, 1995.
8. 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.
9. 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), Proceedings to be published by Springer-Verlag.
10. L.R. Knudsen, Practically secure Feistel ciphers, Fast Software Encryption, Springer-Verlag, pp. 211-221, 1994.
11. M. Matsui, Linear cryptanalysis method for DES cipher, Advances in Cryptology—EUROCRYPT’93, Springer-Verlag, pp. 386-397, 1994.
12. M. Matsui, On correlation between the order of s-boxes and the strength of DES, Advances in Cryptology—EUROCRYPT’94, Springer-Verlag, pp. 366-375, 1995.
13. W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology—EUROCRYPT’89, Springer-Verlag, pp. 549-562, 1990.
14. K. Nyberg, Linear approximation of block ciphers, Advances in Cryptology—EUROCRYPT’94, Springer-Verlag, pp. 439-444, 1995.
15. C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, no. 4, pp. 656-715, 1949.