Skip to main content
Log in

On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity

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

Abstract

Recently, two classes of Boolean functions with optimal algebraic immunity have been proposed by Carlet et al. and Wang et al., respectively. Although it appears that their methods are very different, it is proved in this paper that the two classes of Boolean functions are in fact affine equivalent. Moreover, the number of affine equivalence classes of these functions is also studied.

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. Armknecht F., Krause M.: Algebraic attacks on combiners with memory. In: Advances in Cryptology—CRYPTO 2003, LNCS, vol. 2729, pp. 162–176 (2003).

  2. Braeken A., Preneel B.: On the algebraic immunity of symmetric Boolean functions. In: Progress in Cryptology—INDOCRYPT 2005, LNCS, vol. 3797, pp. 35–48 (2005).

  3. Carlet C., Dalai D.K., Gupta K.C., Maitra S.: Algebraic immunity for cryptographically significant Boolean functions: analysis and construction. IEEE Trans. Inform. Theory 52(7), 3105–3121 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Carlet C., Feng K.Q.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attack and good nonlinearity. In: Advances in Cryptology—ASIACRYPT 2008, LNCS, vol. 5350, pp. 425–440 (2008).

  5. Carlet C., Zeng X., Li C., Hu L.: Further properties of several classes of Boolean functions with optimum algebraic immunity. Des. Codes Cryptogr. 52(3), 303–338 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Courtois N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology—CRYPTO 2003, LNCS, vol. 2729, pp. 176–194 (2003).

  7. Courtois N., Meier W.: Algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology—EUROCRYPT 2003, LNCS, vol. 2656, pp. 345–359 (2003).

  8. Dalai D.K., Maitra S., Sarkar S.: Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Des. Codes Cryptogr 40(1), 41–58 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hong S.J., Bossen D.C.: On some properties of self-reciprocal polynomials. IEEE Trans. Inform. Theory 21(4), 462–464 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li N., Qu L.J., Qi W.F., Feng G.Z., Li C., Xie D.Q.: On the construction of Boolean functions with optimal algebraic immunity. IEEE Trans. Inform. Theory 54(3), 1330–1334 (2008)

    Article  MathSciNet  Google Scholar 

  11. Lobanov M.: Tight bound between nonlinearity and algebraic immunity. Cryptology ePrint Archive, Report 2005/441. http://eprint.iacr.org/2005/441.pdf (2005).

  12. Meier W., Pasalic E., Carlet C.: Algebraic attacks and decomposition of Boolean functions. In: Advances in Cryptology—EUROCRYPT 2004, LNCS, vol. 3207, pp. 474–491 (2004).

  13. Qu L.J., Li C., Feng K.Q.: A note on symmetric Boolean functions with maximum algebraic immunity on odd number of variables. IEEE Trans. Inform. Theory 53(8), 2908–2910 (2007)

    Article  MathSciNet  Google Scholar 

  14. Wang Q.C., Peng J., Kan H.B., Xue X.Y.: Constructions of cryptographically significant Boolean functions using primitive polynomials. IEEE Trans. Inform. Theory 56(6), 3048–3053 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huajin Chen.

Additional information

Communicated by J. Wolfmann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H., Tian, T. & Qi, W. On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity. Des. Codes Cryptogr. 67, 175–185 (2013). https://doi.org/10.1007/s10623-011-9596-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-011-9596-8

Keywords

Mathematics Subject Classification (2000)

Navigation