Substitution-permutation networks resistant to differential and linear cryptanalysis

Journal of Cryptology

Volumn 9, Issue 1, 1996, Pages 1-19

  Keys, Howard M ^a   Tavares, Stafford E ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Differential cryptanalysis; Linear cryptanalysis; Product cipher; S box; Substitution permutation network

Indexed keywords

EID: 0003099980     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02254789     Document Type: Article

References (31)

1. C. M. Adams. A Formal and Practical Design Procedure for Substitution-Permutation Network Cryptosystems. Ph.D. thesis, Queen's University, Kingston, Ontario, 1990.
2. C. M. Adams. On immunity against Biham and Shamir's differential cryptanalysis. Information Processing Letters, 41(2):77-80,1992.
3. C. M. Adams and S. E. Tavares. The structured design of cryptographically good S-boxes. Journal of Cryptology, 3(l):21-4l, 1990.
4. F. Ayoub. The design of complete encryption networks using cryptographically equivalent permutations. Computers and Security, 2:261-267, 1982.
5. E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(l):3-72,1991.
6. E. Biham and A. Shamir. Differential cryptanalysis of FEAL and N-Hash. Advances in Cryptology: Proceedings ofEUROCRYPT '91, Springer-Verlag, Berlin, pages 1-16, 1991.
7. E. Biham and A. Shamir. Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI, and Lucifer. Advances in Cryptology: Proceedings ofCRYPTO '91, Springer-Verlag, Berlin, pages 156-171, 1992.
8. E. Biham and A. Shamir. Differential cryptanalysis of the full 16-round DES. Advances in Cryptology: Proceedings ofCRYPTO '92, Springer-Verlag, Berlin, pages 487-496, 1993.
9. E. F. Brickell, J. H. Moore, and M. R. Purtill. Structures in the S-boxes of DES. Advances in Cryptology: Proceedings ofCRYPTO '86, Springer-Verlag, Berlin, pages 3-8, 1987.
10. L. Brown, J. Pieprzyk, and J. Seberry. LOKI-a cryptographic primitive for authentication and secrecy applications. Advances in Cryptology: Proceedings ofAUSCRYPT '90, Springer-Verlag, Berlin, pages 229-236, 1990.
11. L. Brown and J. R. Seberry. On the design of permutation P in DES type cryptosystems. Advances in Cryptology: Proceedings ofEUROCRYPT '89, Springer-Verlag, Berlin, pages 696-705, 1989.
12. M. H. Dawson and S. E. Tavares. An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks. Advances in Cryptology: Proceedings ofEUROCRYPT '91, Springer-Verlag, Berlin, pages 352-367, 1991.
13. H. Feistel. Cryptography and computer privacy. Scientific American, 228(5):15-23, 1973.
14. H. Feistel, W. A. Notz, and J. L. Smith. Some cryptographic techniques for machine-to-machine data communications. Proceedings of the IEEE, 63(11): 1545-1554, 1975.
15. R. Forré. Methods and instruments for designing S-boxes. Journal of Cryptology, 2(3):115-130, 1990.
16. J. B. Kam and G. I. Davida. A structured design of substitution-permutation encryption networks. IEEE Transactions on Computers, 28(10):747-753, 1979.
17. L. R. Knudsen. Iterative characteristics of DES and s2-DES. Advances in Cryptology: Proceedings of CRYPTO '92, Springer-Verlag, Berlin, pages 497-511, 1993.
18. M. Matsui. Linear cryptanalysis method for DES cipher. Advances in Cryptology: Proceedings of EUROCRYPT '93, Springer-Verlag, Berlin, pages 386-397, 1994.
19. W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. Advances in Cryptology: Proceedings of EUROCRYPT '89. Springer-Verlag, Berlin, pages 549-562, 1990.
20. National Bureau of Standards. Data Encryption Standard (DES). Federal Information Processing Standard Publication 46, U.S. Department of Commerce, January 1977.
21. K. Nyberg. Perfect nonlinear S-boxes. Advances in Cryptology: Proceedings of EUROCRYPT '91, Springer-Verlag, Berlin, pages 378-386,1991.
22. K. Nyberg. On the construction of highly nonlinear permutations. Advances in Cryptology: Proceedings ofEUROCRYPT '92, Springer-Verlag, Berlin, pages 92-98, 1992.
23. K. Nyberg. Differentially uniform mappings for cryptography. Advances in Cryptology: Proceedings of EUROCRYPT '93, Springer-Verlag, Berlin, pages 55-64, 1994.
24. L. O'Connor. An Analysis of Product Ciphers Based on the Properties of Boolean Functions. Ph.D. thesis, University of Waterloo, Ontario, 1992.
25. L. J. O'Connor. On the distribution of characteristics in bijective mappings. Advances in Cryptology: Proceedings ofEUROCRYPT '93, Springer-Verlag, Berlin, pages 360-370, 1994.
26. J. Pieprzyk and G. Finkelstein. Towards effective nonlinear cryptosystem design. IEE Proceedings, Part E, 135(6):325-335, 1988.
27. B. Preneel, W. Van Leekwijck, L. Van Linden, R. Goevarts, and J. Vanderwalle. Propagation characteristics of boolean functions. Advances in Cryptology: Proceedings ofEUROCRYPT '90, Springer-Verlag, Berlin, pages 161-173, 1991.
28. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical journal, 28:656-715, 1949.
29. A. Shimizu and S. Miyaguchi. Fast data encipherment algorithm: FEAL. Advances in Cryptology: Proceedings ofEUROCRYPT '87, Springer-Verlag, Berlin, pages 267-278, 1988.
30. M. Sivabalan, S. E. Tavares, and L. E. Peppard. On the design of SP networks from an informationtheoretic point of view. Advances in Cryptology: Proceedings ofCRYPTO '92, Springer-Verlag, Berlin, pages 260-279, 1993.
31. A. F. Webster and S. E. Tavares. On the design of S-boxes. Advances in Cryptology: Proceedings of CRYPTO '85, Springer-Verlag, Berlin, pages 523-534, 1986.