Skip to main content
Log in

Dirichlet product for boolean functions

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Boolean functions play an important role in many symmetric cryptosystems and are crucial for their security. It is important to design boolean functions with reliable cryptographic properties such as balancedness and nonlinearity. Most of these properties are based on specific structures such as Möbius transform and Algebraic Normal Form. In this paper, we introduce the notion of Dirichlet product and use it to study the arithmetical properties of boolean functions. We show that, with the Dirichlet product, the set of boolean functions is an Abelian monoid with interesting algebraic structure. In addition, we apply the Dirichlet product to the sub-family of coincident functions and exhibit many properties satisfied by such functions.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Apostol, T.M.: Introduction to Analytic Number Theory. Springer, New York (1976)

    MATH  Google Scholar 

  2. Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, Cambridge (2010)

    Chapter  Google Scholar 

  3. Crama, Y., Hammer, P.L.: Boolean Functions, Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2010)

    MATH  Google Scholar 

  4. Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically significant boolean functions: construction and analysis in terms of algebraic immunity, In: INDOCRYPT, Lecture Notes in Computer Science, Number 3348, pp. 92–106, Springer, New York (2004)

  5. Pieprzyk, J., Zhang, X.M.: Computing Möbius transforms of boolean functions and characterizing coincident boolean functions. In: Proceedings of the International Conference on Boolean Functions: Cryptography and Applications (2007)

  6. Pieprzyk, J., Wang, H., Zhang, X.M.: Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions. Int. J. Comput. Math. 88(7), 1398–1416 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Sarkar, P., Maitra, S.: Construction of nonlinear Boolean functions with important cryptographic properties. In: EUROCRYPT 2000, Number 1807 in Lecture Notes in Computer Science, pp. 485–506. Springer, New York (2000)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abderrahmane Nitaj.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nitaj, A., Susilo, W. & Tonien, J. Dirichlet product for boolean functions. J. Appl. Math. Comput. 55, 293–312 (2017). https://doi.org/10.1007/s12190-016-1037-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-016-1037-4

Keywords

Mathematics Subject Classification

Navigation