Skip to main content
SpringerLink
Log in

On Boolean functions with the sum of every two of them being bent

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric designs with the same design parameters as those systems derived from Kerdock sets. Further we observe that there are bent sets of size equal to the square root of the Kerdock set size which consist of Boolean functions with arbitrary degrees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bending T.D., Fon-Der-Flaas D.: Crooked functions, bent functions, and distance regular graphs. Electron. J. Combin. 5 (1998) Research Paper 34, 14 pp (electronic).

  2. Cameron, P.J.: On groups with several doubly-transitive permutation representations. Math. Z. 128, 1–14 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cameron, P.J., Seidel, J.J.: Quadratic forms over GF(2). Indag. Math. 35, 1–8 (1973)

    MathSciNet  Google Scholar 

  4. Cameron, P.J., van Lint, J.H.: Designs, Graphs, Codes and Their Links. Cambridge University Press, Cambridge (1991)

    MATH  Google Scholar 

  5. Carlet C.: Vectorial Boolean functions for cryptography. In: Crama Y., Hammer P. (eds.) Boolean Methods and Models. Cambridge University Press (to appear).

  6. Carlet C.: Boolean functions for cryptography and error correcting codes. In: Crama Y., Hammer P. (eds.) Boolean Methods and Models. Cambridge University Press (to appear).

  7. van Dam, E.R.: Three-class association schemes. J. Alg. Combin. 10, 69–107 (1999)

    Article  MATH  Google Scholar 

  8. Delsarte P.: An algebraic approach to the association schemes of coding theory. Phillips Res. Repts. Suppl. 10 (1973).

  9. Mathon, R.: The systems of linked 2–(16, 6, 2) designs. Ars Combin. 11, 131–148 (1981)

    MATH  MathSciNet  Google Scholar 

  10. Noda, R.: On homogeneous systems of linked symmetric designs. Math. Z. 138, 15–20 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  11. Rothaus, O.S.: On “bent” functions. J. Combin. Theory Ser. A 20, 300–305 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Otto-von-Guericke Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Christian Bey & Gohar M. Kyureghyan

Authors
  1. Christian Bey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gohar M. Kyureghyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Bey.

Additional information

Dedicated to the memory of Hans Dobbertin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bey, C., Kyureghyan, G.M. On Boolean functions with the sum of every two of them being bent. Des. Codes Cryptogr. 49, 341–346 (2008). https://doi.org/10.1007/s10623-008-9196-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9196-4

Keywords

AMS Classifications

Search

Navigation