Skip to main content
Springer Nature Link
Log in

Construction of Cryptographically Important Boolean Functions

  • Conference paper
  • First Online:
Progress in Cryptology — INDOCRYPT 2002 (INDOCRYPT 2002)

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

Included in the following conference series:

Abstract

Boolean functions are used as nonlinear combining functions in certain stream ciphers. A Boolean function is said to be correlation immune if its output leaks no information about its input values. Balanced correlation immune functions are called resilient functions. Finding methods for easy construction of resilient functions with additional properties is an active research area. Maitra and Pasalic[3] have constructed 8-variable 1-resilient Boolean functions with nonlinearity 116. Their technique interlinks mathematical results with classical computer search. In this paper we describe a new technique to construct 8-variable 1-resilient Boolean functions with the same nonlinearity. Using a similar technique, we directly construct 10-variable (resp. 12-variable), 1-resilient functions with nonlinearity 488 (resp. 1996). Finally, we describe some results on the construction of n-variable t-resilient functions with maximum nonlinearity.

This research was supported by ReX program of Stichting Nlnet, Netherlands.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Biham, E. and Shamir, A., Differential cryptanalysis of DES-like cryptosystems., Journal of Cryptology Vol 4, No. 1, 1991, 3–72.

    Article  MATH  MathSciNet  Google Scholar 

  2. Carlet, C. and Ding, C., Highly nonlinear mappings. Email: Claude.Carlet@inria.fr (C. Carlet), cding@cs.ust.hk (C. Ding). 238

    Google Scholar 

  3. Maitra, S. and Pasalic, E., Further construction of resilient Boolean functions with very high nonlinearity. IEEE Trans. on Information Theory, Vol 48, No. 7, July 2002, 1825–1834.

    Article  MATH  MathSciNet  Google Scholar 

  4. Matsui, M., Linear cryptanalysis method for DES cipher. Advances in Cryptology-EUROCRYPT 1993, LNCS 765, 1994, pp. 386–397.

    Chapter  Google Scholar 

  5. Nyberg, K., Perfect non-linear S-boxes. Advances in Cryptology-EUROCRYPT 1991, LNCS 547, 1992, pp. 378–386.

    Chapter  Google Scholar 

  6. Rothaus, O. S., On bent functions, J. Combin. Theory, Ser. A 20, 1976, 300–305.

    Article  MATH  MathSciNet  Google Scholar 

  7. Sarkar, P. and Maitra, S., Nonlinearity bounds and constructions of resilient Boolean functions. CRYPTO 2000, LNCS 1880, 2000, pp. 515–532.

    Chapter  Google Scholar 

  8. Siegenthaler, T., Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. on Information Theory, IT-30(5), September 1984, 776–780.

    Article  MathSciNet  Google Scholar 

  9. Tarannikov, Y.V., On resilient Boolean functions with maximum possible nonlinearity. In Progress in Cryptology-INDOCRYPT 2000, LNCS 1977, Springer Verlag, 2000, pp. 19–30.

    Google Scholar 

  10. Xiao, G. and Massey, J. L., A spectral characterization of correlation-immune functions. IEEE Trans. on Information Theory, 34(3), 1988, 569–571.

    Article  MATH  MathSciNet  Google Scholar 

  11. Zheng, Y. and Zhang, X.M., Improved upper bound on the nonlinearity of high order correlation immune functions. In Selected Areas in Cryptography-SAC 2000, LNCS 2012, 2000, pp. 264–274.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, 203 B. T. Road, 700108, Calcutta, INDIA

    Soumen Maity

  2. Department of Information Technology, Lund University, P.O. Box 118, S-221 00, Lund, SWEDEN

    Thomas Johansson

Authors
  1. Soumen Maity
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Johansson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Alfred Menezes

  2. Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, 700108, Kolkata, India

    Palash Sarkar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maity, S., Johansson, T. (2002). Construction of Cryptographically Important Boolean Functions. In: Menezes, A., Sarkar, P. (eds) Progress in Cryptology — INDOCRYPT 2002. INDOCRYPT 2002. Lecture Notes in Computer Science, vol 2551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36231-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36231-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00263-5

  • Online ISBN: 978-3-540-36231-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics