Skip to main content
SpringerLink
Log in

A note on the construction and upper bounds of correlation-immune functions

  • Conference paper
  • First Online:
Crytography and Coding (Cryptography and Coding 1997)

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

Included in the following conference series:

Abstract

In this paper, an algorithm for the construction of correlation-immune functions is given. It will be shown that the proposed algorithm provides a method to construct every mth order correlationimmune function. Besides correlation-immunity, also other properties of Boolean functions, like Hamming weight, can be taken into account. The complexity analysis of the proposed algorithm leads to a new upper bound for the number of specified correlation-immune functions and correlation-immune functions in general, depending on the number of input variables n and the order of correlation-immunity.

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. P. Camion, C. Carlet, P. Charpin, N. Sendrier: ‘On Correlation-immune Functions', Advances in Cryptology: Crypto '91, Proceedings, Lecture Notes on Computer Science 576, 1991, p. 86–100

    Google Scholar 

  2. X. Guo-Zhen, J. Massey: ‘A Spectral Characterization of CorrelationImmune Combining Functions', IEEE Transactions on Information Theory, Vol. 34, No.3, May 1988, p. 569–571

    Article  Google Scholar 

  3. J. Seberry, X. Zhang, Y. Zheng: ‘On Constructions and Nonlinearity of Correlation Immune Functions', Advances in Cryptology: Eurocrypt '93, Proceedings, Lecture Notes on Computer Science 765, 1993, p. 181–199

    Google Scholar 

  4. T. Siegenthaler: ‘Correlation-Immunity of Nonlinear Combining Functions of Cryptographic Applications', IEEE Transactions on Information Theory, Vol. IT-30, No.5, Sep. 1984, p. 776–780

    Article  Google Scholar 

  5. T. Siegenthaler: ‘Decrypting a Class of Stream Ciphers Using Ciphertext Only', IEEE Transactions on Computers, Vol. C-34, No.1, Jan. 1985, p. 81–85

    Google Scholar 

  6. Y. Yang, B. Guo: ‘Further Enumerating Boolean Functions of Cryptographic Significance', Journal of Cryptology, 1995, 8: p. 115–122

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrgebiet Kommunikationssysteme, University of Hagen, 58084, Hagen, Germany

    Markus Schneider

Authors
  1. Markus Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, M. (1997). A note on the construction and upper bounds of correlation-immune functions. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024475

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation