Skip to main content
SpringerLink
Log in
Book cover

Sequences and their Applications pp 265–280Cite as

Further Constructions of Resilient Boolean Functions with Very High Nonlinearity

  • Conference paper

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Summary

One well known method of generating key stream sequences for stream ciphers is to combine the outputs of several Linear Feedback Shift Registers (LFSR) using a combining Boolean function. Here we concentrate on the design of good combining Boolean functions. We provide resilient Boolean functions with currently best known nonlinearity. These functions were not known earlier and the problems of their existence were posed as open questions in literature. Some of the functions we construct here achieve the provable upper bound on nonlinearity for resilient Boolean functions. Our technique interlinks mathematical results with classical computer search.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

  2. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation immune functions. In Advances in Cryptology - CRYPTO’91, pages 86–100. Springer-Verlag, 1992.

    Google Scholar 

  3. A. Canteaut and M. Trabbia. Improved fast correlation attacks using parity- check equations of weight 4 and 5. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 573–588. Springer Verlag, 2000.

    Chapter  Google Scholar 

  4. C Carlet. On the coset weight divisibility and nonlinearity of resilient and correlation immune functions. In Sequences and Their Applications, SETA 2001.

    Google Scholar 

  5. C. Carlet and P. Sarkar. Spectral domain analysis of correlation immune and resilient Boolean functions. Accepted in Finite Fields and Its Applications, 2001.

    Google Scholar 

  6. C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Number 561 in Lecture Notes in Computer Science. Springer-Verlag, 1991.

    MATH  Google Scholar 

  7. E. Filiol and C. Fontaine. Highly nonlinear balanced Boolean functions with a good correlation-immunity. In Advances in Cryptology - EUROCRYPT’98. Springer-Verlag, 1998.

    Google Scholar 

  8. X. Guo-Zhen and J. Massey. A spectral characterization of correlation immune combining functions. IEEE Transactions on Information Theory, 34(3):569–571, May 1988.

    Article  MATH  Google Scholar 

  9. T Johansson and F Jonsson. Fast correlation attacks through reconstruction of linear polynomials. In Advances in Cryptology — CRYPTO 2000, number 1880 in Lecture Notes in Computer Science, pages 300–315. Springer Verlag, 2000.

    Google Scholar 

  10. S. Maitra. Correlation immune Boolean functions with very high nonlinearity. Cryptology ePrint Archive, eprint.iacr.org, No. 2000/054, October 27, 2000.

    Google Scholar 

  11. S. Maitra and P. Sarkar. Hamming weights of correlation immune Boolean functions. Information Processing Letters, 71(3–4):149–153, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  12. W. Meier and O. Staffelbach. Fast correlation attack on stream ciphers. In Advances in Cryptology - EUROCRYPT’88, volume 330, pages 301–314. Springer-Verlag, May 1988.

    Google Scholar 

  13. E. Pasalic and T. Johansson. Further results on the relation between nonlinearity and resiliency of Boolean functions. In IMA Conference on Cryptography and Coding, number 1746 in Lecture Notes in Computer Science, pages 35–45. Springer-Verlag, 1999.

    Google Scholar 

  14. E. Pasalic, S. Maitra, T. Johansson and P. Sarkar. New constructions of re-silient and correlation immune Boolean functions achieving upper bounds on nonlinearity. In Workshop on Coding and Cryptography, Paris, January 2001.

    Google Scholar 

  15. O. S. Rothaus. On bent functions. Journal of Combinatorial Theory, Series A, 20:300–305, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  16. P. Sarkar and S. Maitra. Construction of nonlinear Boolean functions with important cryptographic properties. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 485–506. Springer Verlag, 2000.

    Chapter  Google Scholar 

  17. P Sarkar and S Maitra. Nonlinearity bounds and constructions of resilient Boolean functions. In Advances in Cryptology — CRYPTO 2000, number 1880 in Lecture Notes in Computer Science, pages 515–532. Springer Verlag, 2000.

    Google Scholar 

  18. J. Seberry, X. M. Zhang, and Y. Zheng. On constructions and nonlinearity of correlation immune Boolean functions. In Advances in Cryptology - EURO- CRYPT’93, pages 181–199. Springer-Verlag, 1994.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, C-34(l):81–85, January 1985.

    Article  Google Scholar 

  21. Y. V. Tarannikov. On resilient Boolean functions with maximum possible non-linearity. Proceedings of INDOCRYPT, LNCS volume 1977, 19–30, 2000.

    Google Scholar 

  22. Y. Zheng and X. M. Zhang. Improving upper bound on nonlinearity of high order correlation immune functions. In SAC 2000, Lecture Notes in Computer Science. Springer Verlag, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Statistical Institute, 203, B.T. Road, Calcutta, 700 035, India

    Subhamoy Maitra

  2. Lund University, P.O. Box 118, 221 00, Lund, Sweden

    Enes Pasalic

Authors
  1. Subhamoy Maitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enes Pasalic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    T. Helleseth

  2. Communication Sciences Institute, Department of Electrical Engineering Systems, University of Southern California, 90089-2565, Los Angeles, CA, USA

    P. V. Kumar

  3. Department of Electronic and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    K. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this paper

Cite this paper

Maitra, S., Pasalic, E. (2002). Further Constructions of Resilient Boolean Functions with Very High Nonlinearity. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0673-9_20

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-529-8

  • Online ISBN: 978-1-4471-0673-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation