How to improve the nonlinearity of bijective s-boxes

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

Volumn 1438, Issue , 1998, Pages 181-192

  Millan, William ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

RANDOM GENERATION; S-BOXES; SUBSTITUTION BOXES;

SECURITY OF DATA;

EID: 21444458042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053732     Document Type: Conference Paper

References (26)

1. T. Beth and C. Ding. On Almost Perfect Nonlinear Permutations. In Advances in Cryptology-Eurocrypt '93, Proceedings, LNCS, volume 765, pages 65-76. Springer-Verlag, 1994.
2. A. Canteaut. Differential cryptanalysis of Feistel ciphers and differentially 5-uniform mappings. In Workshop on Selected Areas in Cryptology 1997, Workshop Record, pages 172-184, 1997.
3. J. Daemen, R. Govaerts, and J. Vandewalle. Correlation Matrices. In Fast Software Encryption, 1994 Leuven Workshop, LNCS, volume 1008, pages 275-285. Springer-Verlag, 1994.
4. D. Feng and B. Liu. Almost perfect nonlinear permutations. Electronics Letters, 30(3):208-209, 3February 1994.
5. K. Kim, T. Matsumoto, and H. Imai. A Recursive Construction Method of SBoxes Satisfying Strict Avalanche Criterion. In Advances in Cryptology-Crypto '90, Proceedings, LNCS, volume 537, pages 564-574. Springer-Verlag, 1991.
6. M. Matsui. Linear Cryptanaiysis Method for DES Cipher. In Advances in Cryptology-Eurocrypt '93, Proceedings, LNCS, volume 765, pages 386-397. Springer-Verlag, 1994.
7. M. Matsui. New Block Encryption Algorithm MISTY. In Fast Software Encryption, 1997 Haifa Workshop, volume 1267 of Lecture Notes in Computer Science, pages 54-68. Springer-Verlag, 1997.
8. W. Millan, A. Clark, and E. Dawson. Smart Hill Climbing Finds Better Boolean Functions. In Workshop on Selected Areas in Cryptology 1997, Workshop Record, pages 50-63, 1997.
9. W. Millan and E. Dawson. On the Security of Self-Synchronous Ciphers. In Proceedings of A CISP97, volume 1270 of Lecture Notes in Computer Science, pages 159-170. Springer-Verlag, 1997.
10. K. Nyberg. Perfect Nonlinear S-Boxes. In Advances in Cryptology-Eurocrypt '91, Proceedings, LNCS, volume 547, pages 378-386. Springer-Verlag, 1991.
11. K. Nyberg. On the Construction of Highly Nonlinear Permutations. In Advances in Cryptology-Eurocrypt '92, Proceedings, LNCS, volume 658, pages 92-98. Springer-Verlag, 1993.
12. K. Nyberg. Differentially uniform mappings for cryptography. In Advances in Cryptology-Eurocrypt '93, Proceedings, LNCS, volume 765, pages 55-64. Springer-Verlag, 1994.
13. K. Nyberg and L.R. Knudsen. Provable Security against Differential Cryptanalysis. In Advances in Cryptology-Crypto '92, Proceedings, LNCS, volume 740, pages 566-574. Springer-Verlag, 1993.
14. J. Pieprzyk. Non-linearity of Exponent Permutations. In Advances in Cryptology-Eurocrypt '89, Proceedings, LNCS, volume 434, pages 81-92. Springer-Verlag, 1990.
15. J. Pieprzyk. Bent Permutations. In International Conference on Finite Fields, Coding Theory and Advances in Communications, Las Vegas, pages 173-181, 1991.
16. J. Pieprzyk, C. Charnes, and J. Seberry. Linear Approximation Versus Nonlinearity. In Workshop on Selected Areas in Cryptology 1994, Proceedings, pages 82-90, 1994.
17. J. Pieprzyk and G. Finkelstein. Permutations that Maximise Non-Linearity and their Cryptographic Significance. In Proceedings of Fifth IFIP International Conference on Computer Security IFIP/SEC'88, pages 63-74, 1988.
18. J. Pieprzyk and G. Finkelstein. Towards Effective Nonlinear Cryptosystem Design. IEE Proceedings, Pt E., 135(6):325-335, November 1988.
19. J.P. Pieprzyk. Error Propagation Property and Application in Cryptography. IEE Proceedings, Pt E., 136:262-270, July 1989.
20. O.S. Rothaus. On Bent Functions. Journal of Combinatorial Theory (A), 20:300-305, 1976.
21. J. Seberry, X.-M. Zhang, and Y. Zheng. Cryptographic Boolean Functions via Group Hadamard Matricies. Australasian Journal of Combinatorics, 10:131-145, 1994.
22. J. Seberry, X.-M. Zhang, and Y. Zheng. Pitfalls in Designing Substitution Boxes (Extended Abstract). In Advances in Cryptology-Crypto '94, Proceedings, LNCS, volume 839, pages 383-396. Springer-Verlag, 1994.
23. J. Seberry, X.-M. Zhang, and Y. Zheng. Relationships Among Nonlinearity Criteria (Extended Abstract). In Advances in Cryptology-Eurocrypt '94, Proceedings, LNCS, volume 950, pages 376-388. Springer-Verlag, 1994.
24. J. Seberry, X.-M. Zhang, and Y. Zheng. Systematic Generation of Cryptographically Robust S-Boxes. In Proceedings of the First A CM Conference on Computer and Communications Security, pages 171-182, 1994.
25. A.F. Webster and S.E. Tavares. On the Design of S-Boxes. In Advances in Cryptology-Crypto '85, Proceedings, LNCS, volume 218, pages 523-534. Springer-Verlag, 1986.
26. X.-M. Zhang and Y. Zheng. Difference Distribution Table of a Regular Substitution Box. In Third Annual Workshop on Selected Areas in Cryptology 1996, Workshop Record, pages 57-60, 1996.