Skip to main content
SpringerLink
Log in

How to improve the nonlinearity of bijective S-boxes

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1438))

Included in the following conference series:

Abstract

A method for the systematic improvement of the nonlinearity of bijective substitution boxes is presented. It is shown how to select two outputs so that swapping them increases the nonlinearity. Experimental results show that highly nonlinear bijective substitutions can be obtained by this method that are difficult to obtain by random generation. A survey of results in the design of S-boxes is included.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  4. D. Feng and B. Liu. Almost perfect nonlinear permutations. Electronics Letters, 30(3):208–209, 3 February 1994.

    Article  Google Scholar 

  5. K. Kim, T. Matsumoto, and H. Imai. A Recursive Construction Method of S-Boxes Satisfying Strict Avalanche Criterion. In Advances in Cryptology — Crypto '90, Proceedings, LNCS, volume 537, pages 564–574. Springer-Verlag, 1991.

    Google Scholar 

  6. M. Matsui. Linear Cryptanalysis Method for DES Cipher. In Advances in Cryptology — Eurocrypt '93, Proceedings, LNCS, volume 765, pages 386–397. Springer-Verlag, 1994.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  9. W. Millan and E. Dawson. On the Security of Self-Synchronous Ciphers. In Proceedings of ACISP97, volume 1270 of Lecture Notes in Computer Science, pages 159–170. Springer-Verlag, 1997.

    Google Scholar 

  10. K. Nyberg. Perfect Nonlinear S-Boxes. In Advances in Cryptology — Eurocrypt '91, Proceedings, LNCS, volume 547, pages 378–386. Springer-Verlag, 1991.

    Google Scholar 

  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.

    Google Scholar 

  12. K. Nyberg. Differentially uniform mappings for cryptography. In Advances in Cryptology — Eurocrypt '93, Proceedings, LNCS, volume 765, pages 55–64. Springer-Verlag, 1994.

    Google Scholar 

  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.

    Google Scholar 

  14. J. Pieprzyk. Non-linearity of Exponent Permutations. In Advances in Cryptology — Eurocrypt '89, Proceedings, LNCS, volume 434, pages 81–92. Springer-Verlag, 1990.

    Google Scholar 

  15. J. Pieprzyk. Bent Permutations. In International Conference on Finite Fields, Coding Theory and Advances in Communications, Las Vegas, pages 173–181, 1991.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  18. J. Pieprzyk and G. Finkelstein. Towards Effective Nonlinear Cryptosystem Design. IEE Proceedings, Pt E., 135(6):325–335, November 1988.

    Google Scholar 

  19. J.P. Pieprzyk. Error Propagation Property and Application in Cryptography. IEE Proceedings, Pt E., 136:262–270, July 1989.

    Google Scholar 

  20. O.S. Rothaus. On Bent Functions. Journal of Combinatorial Theory (A), 20:300–305, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Seberry, X.-M. Zhang, and Y. Zheng. Cryptographic Boolean Functions via Group Hadamard Matricies. Australasian Journal of Combinatorics, 10:131–145, 1994.

    MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  24. J. Seberry, X.-M. Zhang, and Y. Zheng. Systematic Generation of Cryptographically Robust S-Boxes. In Proceedings of the First ACM Conference on Computer and Communications Security, pages 171–182, 1994.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4001, Brisbane, Queensland, Australia

    William Millan

Authors
  1. William Millan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd Ed Dawson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Millan, W. (1998). How to improve the nonlinearity of bijective S-boxes. In: Boyd, C., Dawson, E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053732

Download citation

  • DOI: https://doi.org/10.1007/BFb0053732

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64732-4

  • Online ISBN: 978-3-540-69101-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation