Skip to main content

A New Representation of Boolean Functions

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1999)

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

Abstract

We study a representation of Boolean functions (and more generally of integer-valued / complex-valued functions), not used until now in coding and cryptography,which yields more information than the currently known representations,on the combinatorial, spectral and cryptographic properties of the functions.

AMS classification numbers: 06E30, 11T23, 94A60.

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

Access this chapter

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. C. Carlet.Generalized Partial Spreads,IEEE Transactions on Information Theory vol 41 (1995) 1482–1487

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Carlet and P. Guillot.A characterization of binary bent functions,Journal of Combinatorial Theory,Series A, Vol.76, No.2 (1996) 328–335

    Article  MATH  MathSciNet  Google Scholar 

  3. J. F. Dillon.Elementary Hadamard Difference sets,Ph. D. Thesis,Univ. of Maryland (1974).

    Google Scholar 

  4. C.J.A. Jansen. Investigation on Nonlinear Streamcipher Systems: Construction and Evaluation Methods Philips (1989).

    Google Scholar 

  5. J.P.S. Kung.Source Book in Matroïid Theory,Birkhaüser (1986).

    Google Scholar 

  6. Meier, W. and O. Staffelbach.Nonlinearity Criteria for Cryptographic Functions, Advances in Cryptology, EUROCRYPT’ 89,Lecture Notes in Computer Science 434, 549–562,Springer Verlag (1990).

    Google Scholar 

  7. F. J. Mac Williams and N. J. Sloane.The theory of error-correcting codes,Amsterdam, North Holland 1977.

    Google Scholar 

  8. Gian-Carlo Rota. On the foundations of Combinatorial Theory; Springer Verlag (1964);reprint in [5].

    Google Scholar 

  9. O. S. Rothaus. On bent functions, J. Comb. Theory, 20A (1976) 300–305.

    Article  MathSciNet  Google Scholar 

  10. J. H. Van Lint. Coding Theory, Springer Verlag 201 (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlet, C., Guillot, P. (1999). A New Representation of Boolean Functions. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics