Skip to main content
Log in

A note on two classes of Boolean functions with optimal algebraic immunity

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Tu and Deng proposed a class of bent functions which are of optimal algebraic immunity under the assumption of a combinatorial conjecture. In this paper, the authors compute the dual of the Tu-Deng functions and then show that they are still of optimal algebraic immunity under the assumption of the same conjecture. For another class of Boolean functions constructed by Tang, et al. which are of optimal algebraic immunity with similar forms to Tu-Deng functions, the authors show that they are not bent functions by using some basic properties of binary complete Kloosterman sums.

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. Carlet C, Boolean functions for Cryptography and Error Correcting Codes, Boolean Methods and Models in Mathematics, Computer Science, and Engineering (eds. by Crama Y and Hammer P), Cambridge University Press, Cambridge, 2010.

    Google Scholar 

  2. Courtois N and Meier W, Algebraic attacks on stream ciphers with linear feedback, Advances in Cryptology—EUROCRYPT 2003 (ed. by Biham E), Warsaw, 2003.

    Google Scholar 

  3. Shannon C, Communication theory of secrecy systems, Bell System Technical Journal, 1949, 28: 656–715.

    Article  MATH  MathSciNet  Google Scholar 

  4. Meier W, Pasalic E, and Carlet C, Algebraic attacks and decomposition of Boolean functions, Advances in Cryptology—EUROCRYPT 2004 (eds. by Cachin C and Camenisch J), Interlaken, 2004.

    Google Scholar 

  5. Carlet C, Dalai D, Gupta K, and Maitra S, Algebraic immunity for cryptographically significant Boolean functions: Analysis and construction, IEEE Transactions on Information Theory, 2006, 52(7): 3105–3121.

    Article  MATH  MathSciNet  Google Scholar 

  6. Dalai D, Gupta K, and Maitra S, Results on algebraic immunity for cryptographically significant Boolean functions, Progress in Cryptology—INDOCRYPT 2004 (eds. by Canteaut A and Viswanathan K), Chennai, 2004.

    Google Scholar 

  7. Didier F, Using Wiedemann’s algorithm to compute the immunity against algebraic and fast algebraic attacks, Progress in Cryptology—INDOCRYPT 2006 (eds. by Barua R and Lange T), Kolkata, 2006.

    Google Scholar 

  8. Lobanov M, Tight bound between nonlinearity and algebraic immunity, IACR Cryptology ePrint Archive, 2005, report 2005/441.

    Google Scholar 

  9. Carlet C, A method of construction of balanced functions with optimum algebraic immunity, IACR Cryptology ePrint Archive, 2006, reprot 2006/149.

    Google Scholar 

  10. Li N, Qu L, and Qi W, On the construction of Boolean functions with optimal algebraic immunity, IEEE Transactions on Information Theory, 2008, 54(3): 1330–1334.

    Article  MathSciNet  Google Scholar 

  11. Xie Y and Hu L, A matrix construction of Boolean functions with maximum algebraic immunity, Journal of Systems Science and Complexity, 2012, 25(4): 792–801.

    Article  MATH  MathSciNet  Google Scholar 

  12. Carlet C and Feng K, An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonliearity, Advances in Cryptology—ASIACRYPT 2008 (ed. by Pieprzyk J), Melbourne, 2008.

    Google Scholar 

  13. Tu Z and Deng Y, A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity, Design Codes and Cryptography, 2011, 60(1): 1–14.

    Article  MATH  MathSciNet  Google Scholar 

  14. Tang D, Carlet C, and Tang X, Highly nonlinear boolean functions with optimum algebraic immunity and good behavior against fast algebraic attacks, IACR Cryptology ePrint Archive, 2011, report 2011/366.

    Google Scholar 

  15. Cohen G and Flori J P, On a generalized combinatorial conjecture involving addition mod 2 k −1, IACR Cryptology ePrint Archive, 2011, report 2011/400.

    Google Scholar 

  16. Zhang Y and Deng Y, Results on permutation symmetric Boolean functions, Journal of Systems Science and Complexity, 2013, 26(2): 302–312.

    Article  MATH  MathSciNet  Google Scholar 

  17. Cusick T, Li Y, and Stanica P, On a conbinatoric conjecture, Integers, 2011, 11(2): 185–203.

    Article  MATH  MathSciNet  Google Scholar 

  18. Dillon J, Elementary hadamard difference sets, Doctor’s degree thesis, University of Maryland, College Park, 1974.

    Google Scholar 

  19. Lachaud G and Wolfmann J, The weights of the orthogonals of the extended quadratic binary Goppa codes, IEEE Transactions on Information Theory, 1990, 36(3): 686–692.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Baofeng Wu.

Additional information

This research was supported by National Basic Research Program of China under Grant No. 2011CB302400.

This paper was recommended for publication by Editor LI Ziming.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, B., Liu, Z., Jin, Q. et al. A note on two classes of Boolean functions with optimal algebraic immunity. J Syst Sci Complex 27, 785–794 (2014). https://doi.org/10.1007/s11424-014-2132-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-2132-y

Keywords

Navigation