Modeling linear characteristics of substitution-permutation networks

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

Volumn 1758, Issue , 2000, Pages 78-91

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

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LINEAR CHARACTERISTICS; LINEAR CRYPTANALYSIS; S-BOXES; SUBSTITUTION PERMUTATION NETWORK; UPPER BOUND;

CRYPTOGRAPHY;

EID: 84944062990     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46513-8_6     Document Type: Conference Paper

References (17)

1. R. Anderson, E. Biham and L. Knudsen, Serpent: A flexible block cipher with max-imum assurance, The First Advanced Encryption Standard Candidate Conference, Proceedings, Ventura, California, August 1998.
2. E. Biham, On Matsui's linear cryptanalysis, Advances in Cryptology— EUROCRYPT'94, Springer-Verlag, Berlin, pp. 341-355, 1995.
3. Z.G. Chen and S.E. Tavares, Towards provable security of substitution-permutation encryption networks, Fifth Annual International Workshop on Selected Areas in Cryptography-SAC'98, Springer-Verlag, Berlin, LNCS 1556, pp. 43-56, 1999.
4. H. Feistel, Cryptography and computer privacy, Scientific American, Vol. 228, No. 5, pp. 15-23, May 1973.
5. H.M. Heys, The design of substitution-permutation network ciphers resistant to cryptanalysis, Ph.D. Thesis, Queen's University, Kingston, Canada, 1994.
6. H.M. Heys and S.E. Tavares, Avalanche characteristics of substitution-permutation encryption networks, IEEE Transactions on Computers, Vol. 44, No. 9, pp. 1131-1139, September 1995.
7. H.M. Heys and S.E. Tavares, Substitution-permutation networks resistant to dif-ferential and linear cryptanalysis, Journal of Cryptology, Vol. 9, No. 1, pp. 1-19, 1996.
8. J.B. Kam and G.I. Davida, Structured design of substitution-permutation encryp-tion networks, IEEE Transactions on Computers, Vol. C-28, No. 10, pp. 747-753, October 1979.
9. M. Matsui, Linear cryptanalysismethod for DES cipher, Advances in Cryptology- Proceedings of EUROCRYPT'93, Springer-Verlag, Berlin, pp. 386-397, 1994.
10. M. Matsui, On correlation between the order of s-boxes and the strength of DES, Advances in Cryptology-EUROCRYPT'94, Springer-Verlag, Berlin, pp. 366-375, 1995.
11. M. Matsui, The first experimental cryptanalysis of the Data Encryption Standard, Advances in Cryptology-CRYPTO'94, Springer-Verlag, Berlin, pp. 1-11, 1994.
12. National Institute of Standards and Technology, Information Technology Labora-tory, The First Advanced Encryption Standard Candidate Conference, Proceed-ings, Ventura, California, August 1998.
13. K. Nyberg, Linear approximation of block ciphers, Advances in Cryptology- EUROCRYPT'94, Springer-Verlag, Berlin, pp. 439-444, 1995.
14. L. O Connor, Properties of linear approximation tables, Fast Software Encryption: Second International Workshop, Springer-Verlag, Berlin, pp. 131-136, 1995.
15. C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, no. 4, pp. 656-715, 1949.
16. A.M. Youssef and S.E. Tavares, Resistance of balanced s-boxes to linear and difier-ential cryptanalysis, Information Processing Letters, Vol. 56, pp. 249-252, 1995.
17. A.M. Youssef Analysis and design of block ciphers Ph.D. Thesis, Queen's Univer-sity, Kingston, Canada, 1997.