Advertisement

Designs, Codes and Cryptography

, Volume 57, Issue 3, pp 271–281 | Cite as

On extended algebraic immunity

  • Chun-peng Wang
  • Xiao-song Chen
Article

Abstract

Algebraic immunity (AI) measures the resistance of a Boolean function f against algebraic attack. Extended algebraic immunity (EAI) extends the concept of algebraic immunity, whose point is that a Boolean function f may be replaced by another Boolean function f c called the algebraic complement of f. In this paper, we study the relation between different properties (such as weight, nonlinearity, etc.) of Boolean function f and its algebraic complement f c . For example, the relation between annihilator sets of f and f c provides a faster way to find their annihilators than previous report. Next, we present a necessary condition for Boolean functions to be of the maximum possible extended algebraic immunity. We also analyze some Boolean functions with maximum possible algebraic immunity constructed by known existing construction methods for their extended algebraic immunity.

Keywords

Algebraic attacks Boolean functions Algebraic immunity Extended algebraic immunity 

Mathematics Subject Classification (2000)

94A60 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Armknecht, F.: Improving fast algebraic attacks. In FSE 2004. Lecture Notes in Computer Science, vol. 3017, pp. 65–82. Springer, Berlin (2005).Google Scholar
  2. 2.
    Armknecht F., Krause M.: Construction single- and multi-output boolean functions with maximal algebraic immunity. In: ICALP 2006, Part II. Lecture Notes in Computer Science, vol. 4052, pp. 180–191. Springer, Berlin (2006).Google Scholar
  3. 3.
    Armknecht F., Carlet C., Gaborit P. et al.: Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. In: Advances in cryptology-Eurocrypt 2006. Lecture Notes in Computer Science, vol. 4004, pp. 147–164. Springer, Berlin (2006).Google Scholar
  4. 4.
    Batten, L.: Algebraic attacks over GF(q). In: Proceedings of Indocrypt 2004. Lecture Notes in Computer Science, vol. 3348, pp. 84–91. Springer, Berlin (2004).Google Scholar
  5. 5.
    Braeken, A., Preneel B.: On the algebraic immunity of symmetric boolean function. INDOCRYPT 2005. Lecture Notes in Computer Science, vol. 3797, pp. 35–48. Springer, Berlin (2005).Google Scholar
  6. 6.
    Camion, P., Canteaut, A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Des. Codes Cryptogr. 16, 121–149. (1999).MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Camion, P., Mihaljevic, M., Imai, H.: Two alerts for design of certain stream ciphers: trapped LFSR and weak resilient function over GF(q). In: SAC 2002. Lecture Notes in Computer Science, vol. 2595, pp.196–213. Springer, Berlin (2003).Google Scholar
  8. 8.
    Canteaut, A.: Open problems related to algebraic attacks on stream ciphers. In: WCC 2005. Lecture Notes in Computer Science, vol. 3969, pp. 120–134. Springer, Berlin (2005).Google Scholar
  9. 9.
    Carlet, C.: Improving the algebraic immunity of resilient and nonlinear functions and constructing Ben functions. http://eprint.iacr.org/2004/276 (2004).
  10. 10.
    Carlet, C.: A method of constuction balanced functions with optimum algebraic immunity. http://eprint.iacr.org/2006/149.
  11. 11.
    Courtois, N.: Fast algebraic attack on stream ciphers with linear feedback. In: Advances in CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729, pp. 1176–1194. Springer, Berlin (2003).Google Scholar
  12. 12.
    Courtois, N.: General principles of algebraic attacks and new design criteria for cipher components. In: AES 2004. Lecture Notes in Computer Science, vol. 3373, pp. 67–83. Springer, Berlin (2005).Google Scholar
  13. 13.
    Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology-Eurocrypt 2003. Lecture Notes in Computer Science, vol. 2656, pp. 345–359. Springer, Berlin (2003).Google Scholar
  14. 14.
    Dalai, D., Gupta, K., Maitra, S.: Results on algebraic immunity for cryptographically significant boolean functions. In: Proceedings of Indocrypt 2004. Lecture Notes in Computer Science, vol. 3348, pp. 92–106. Springer, Berlin (2004).Google Scholar
  15. 15.
    Dalai, D., Gupta, K., Maitra, S.: Cryptographically significant boolean functions: construction and analysis in terms of algebraic immunity. In: Proceedings of Fast Encryption 2005. Lecture Notes in Computer Science, vol. 3557, pp. 98–111. Springer, Berlin (2005).Google Scholar
  16. 16.
    Dalai, D., Maitra, S., Sarkar, S.: Basic theory in construction of boolean functions with maximum possible annihilator immunity. Des. Codes Cryptogr., 40, 41–58 (2006).MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Didier, F., Tillich, J.: Computing the algebraic immunity efficiently. In: Proceedings of Fast Encryption 2006. Lecture Notes in Computer Science, vol. 4047, pp. 359–374. Springer, Berlin (2006).Google Scholar
  18. 18.
    Faugere, J., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Groebner bases. In: CRYPT 2003. Lecture Notes in Computer Science, vol. 2729, pp. 44–60. Springer, Berlin (2003).Google Scholar
  19. 19.
    Li, N., Qi, W.F.: Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity. In: ASIACRYPT 2006. Lecture Notes in Computer Science, vol. 4284, pp. 84–98. Springer, Berlin (2006).Google Scholar
  20. 20.
    Li, N., Qi, W.F.: Symmetric boolean functions depending on an odd number of variables with maximum algebraic immunity. IEEE Trans. Inform. Thoery. 52, 2271–2273 (2006).CrossRefMathSciNetGoogle Scholar
  21. 21.
    Li, N., Qi, W.F.: Boolean functions of an odd number of variables with maximum algebraic immunity. Sci. China Ser. F, 50, 307–317 (2007).MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of boolean functions. In: Advances in Cryptology-Eurocrypt 2004. Lecture Notes in Computer Science, vol. 3027, pp. 474–491. Springer, Berlin (2004).Google Scholar
  23. 23.
    Mihaljevic, M., Fossorier, M., Imai, H.: A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation. In: AAECC 2006. Lecture Notes in Computer Science, vol. 3857, pp. 203–214. Springer, Berlin (2006).Google Scholar
  24. 24.
    Nawaz, Y., Gong, G., Gupta, K.: Upper bounds on algebraic immunity of power functions. In: FSE 2006. Lecture Notes in Computer Science, vol. 4047, pp. 375–389. Springer, Berlin (2006).Google Scholar
  25. 25.
    Sarkar, S., Maitra, S.: Construction of rotation symmetric boolean functions on odd number of variables with maximum algebraic immunity. In: AAECC 2007. Lecture Notes in Computer Science, vol. 4851, pp. 271–280. Springer, Berlin (2007).Google Scholar
  26. 26.
    Yang, B., Chen, J.: All in the XL family: theory and practice. In: ICISC 2004. Lecture Notes in Computer Science, vol. 3506, pp. 67–86. Springer, Berlin (2005).Google Scholar
  27. 27.
    Zhang, X., Pieprzyk, J., Zheng, Y.: On algebraic immunity and annihilators. ICISC 2006. In: Lecture Notes in Computer Science, vol. 4296, pp. 65–80. Springer, Berlin (2006).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Mathematical Science and Computing TechnologyCentral South UniversityChangshaPeople’s Republic of China
  2. 2.Teaching Affairs Division, Dalian University of TechnologyDalianPeople’s Republic of China

Personalised recommendations