Skip to main content
SpringerLink
Log in

New Cryptographic Applications of Boolean Function Equivalence Classes

  • Conference paper
Information Security and Privacy (ACISP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3574))

Included in the following conference series:

Abstract

In this paper we investigate several issues for equivalence classes of Boolean functions which are interesting for cryptology. As well as reviewing the established concepts, we present three new applications of these ideas. Firstly we propose a novel yet natural extension to the existing transform based equivalence class distinguishing algorithm, which can provide improved performance. Secondly, making novel use of the class graph notion, we completely explain the required conditions for high nonlinearity in the concatenation construction of Boolean functions. Finally, we use the linear class graph to comment on algebraic attacks by defining all the equivalence classes possible for the important set of annihilating functions. This approach provides a new solution to the problem of finding (and avoiding) low degree annihilators.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, C.M.: On Immunity Against Biham and Shamir’s Diferential Cryptanalysis. Information Processing Letters 41, 77–80 (1992)

    Article  MATH  Google Scholar 

  2. Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 39–56. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Armknecht, F., Krause, M.: Algebraic Attacks on Combiners with Memory. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 162–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Berlekamp, E.R., Welch, L.R.: Weight distributions of the cosets of the (32,6) Reed-Muller code. IEEE Transactions on Inform. Theory IT-18(1), 203–207 (1972)

    Article  MathSciNet  Google Scholar 

  5. Canteaut, A., Carlet, C., Charpin, P., Fontaine, C.: On Cryptographic Properties of Cosets of R(1, m). IEEE Trans. Inform. Theory 47(4), 1494–1513 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Canteaut, A., Charpin, P.: Decomposing Bent Functions. IEEE Trans. Inform. Theory 49(8), 2004–2019 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Carlet, C.: On the coset weight divisibility and nonlinearity of resilient and correlation immune functions. In: Proceedings of Sequences and Their Applications - SETA 2001. Discrete Mathematics and Theoretical Computer Science, pp. 131–144. Springer, Heidelberg (2001)

    Google Scholar 

  8. Carlet, C., Sarkar, P.: Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions. Finite Fields and Applications 8(1), 120–130 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Courtois, C., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267–287. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  11. Dobbertin, H.: Construction of Bent Functions and Balanced Boolean functions with High Nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61–74. Springer, Heidelberg (1995)

    Google Scholar 

  12. Fuller, J., Millan, W.: Linear Redundancy in S-boxes. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 74–86. Springer, Heidelberg (2003); A preliminary version appears as On Linear Redundancy in the AES S-box, available at IACR e-print archive 111/2002

    Chapter  Google Scholar 

  13. Fuller, J., Millan, W., Dawson, E.: Evolutionary Generation of Bent Functions for Cryptology. In: Proceedings of CEC 2003, pp. 1655–1661. IEEE, Los Alamitos (2003)

    Google Scholar 

  14. Meier, W., Staffelbach, O.: Nolinearity Criteria for Cryptographic Functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990)

    Google Scholar 

  15. Meier, W., Pasalic, E., Carlet, C.: Algebraic Attacks and Decomposition of Boolean Functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Millan, W., Fuller, J., Dawson, E.: New Concepts in Evolutionary Search for Boolean Functions in Cryptography. In: Proceedings of CEC 2003, pp. 2157–2164. IEEE, Los Alamitos (2003)

    Google Scholar 

  17. Patterson, N.J., Wiedemann, D.H.: Correction to - the covering radius of the (215,16) Reed-Muller code is at least 16276. IEEE Trans. Inform. Theory 36, 443 (1990)

    MathSciNet  Google Scholar 

  18. Preneel, B., et al.: Propagation Characteristics of Boolean Functions. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 161–173. Springer, Heidelberg (1991)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Siegenthaler, T.: Correlation immunity of nonlinear combining functions for cryptographic applications. IEEE Trans on IT, IR 30(5), 776–780 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  21. Siegenthaler, T.: Decrypting a Class of Stream Ciphers using Ciphertext only. IEEE Trans on Computers C-34(1), 81–85 (1985)

    Article  Google Scholar 

  22. Tarannikov, Y.: On Resilient Boolean Functions with Maximum Possible Nonlinearity. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 19–30. Springer, Heidelberg (2000); Originally available as IACR eprint 2000/005 from http://www.iacr.org

    Google Scholar 

  23. Webster, A.F., Tavares, S.: On the design of S-boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)

    Google Scholar 

  24. Xiao, G.-Z., Massey, J.L.: A Spectral Characterisation of Correlation Immune Combining Functions. IEEE Trans. IT 34(3), 569–571 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  25. Zheng, Y., Zhang, X.M.: Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 264–274. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  26. Zheng, Y., Zhang, X.M.: On Relationship Among Avalanche, Nonlinearity and Propagation Criteria. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 470–483. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ISI, QUT, GPO Box 2434, Brisbane, Qld, 4001, Australia

    William L. Millan

Authors
  1. William L. Millan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Institute, Queensland University of Technology, GPO Box 2434, Qld 4001, Brisbane, Australia

    Colin Boyd

  2. Information Security Institute, Queensland University of Technology, GPO Box 2434, QLD 4001, Brisbane, Australia

    Juan Manuel González Nieto

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Millan, W.L. (2005). New Cryptographic Applications of Boolean Function Equivalence Classes. In: Boyd, C., González Nieto, J.M. (eds) Information Security and Privacy. ACISP 2005. Lecture Notes in Computer Science, vol 3574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11506157_48

Download citation

  • DOI: https://doi.org/10.1007/11506157_48

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31684-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation