Skip to main content
SpringerLink
Log in

A Family Constructions of Odd-Variable Boolean Function with Optimum Algebraic Immunity

  • Conference paper
Security Technology (SecTech 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 259))

Included in the following conference series:

  • 749 Accesses

Abstract

Algebraic immunity is a novel cryptographic criterion proposed to against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in cryptosystem should have high algebraic immunity. This paper generalizes Dalai’s and Chen’s constructions, and gets a new family constructions for odd-variable Boolean function with optimum algebraic immunity. By employing different transformations of Boolean functions, there would generate different constructions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Courtois, N.T., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Meier, W., Pasalic, E., Carlet, C.: Algebraic Attacks and Decomposition of Boolean Functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Armknecht, F., Krause, M.: Algebraic Attacks on Combiners with Memory. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 162–175. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Courtois, N.T.: Algebraic Attacks on Combiners with Memory and Several Outputs. In: Park, C.-S., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 3–20. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Courtois, N.T.: Cryptanalysis of SFINKS. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 261–269. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Batten, L.M.: Algebraic Attacks over GF(q). In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 84–91. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Faugère, J.-C., Joux, A.: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 44–60. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Armknecht, F.: On the Existence of low-degree Equations for Algebraic Attacks, http://eprint.iacr.org/2004/185

  9. Courtois, N.T., Klimov, A., Patarin, J., Shamir, A.: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392–407. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Kipnis, A., Shamir, A.: Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19–30. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases. AMS, USA (1994)

    Book  MATH  Google Scholar 

  12. Courtois, N.T.: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Armknecht, F.: Improving Fast Algebraic Attacks. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 65–82. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Carlet, C., Dalai, D.K., Gupta, K.C., et al.: Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. IEEE Transactions on Information Theory 52(7), 3105–3121 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98–111. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Braeken, A., Preneel, B.: On the Algebraic Immunity of Symmetric Boolean Functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 35–48. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Dalai, D.K., Maitra, S., Sarkar, S.: Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. Design, Codes and Cryptography 40(1), 41–58 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Carlet, C.: A method of construction of balanced functions with optimum algebraic immunity, http://eprint.iacr.org/2006/149

  19. Carlet, C., Zeng, X., Li, C., et al.: Further properties of several classes of Boolean functions with optimum algebraic immunity, http://eprint.iacr.org/2007/370

  20. Armknecht, F., Carlet, C., Gaborit, P., Künzli, S., Meier, W., Ruatta, O.: Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 147–164. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Li, N., Qi, W.-F.: Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 84–98. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  22. Li, N., Qi, W.: Boolean function of an odd number of variables with maximum algebraic immunity. Science in China, Ser. F 50(3), 307–317 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. Carlet, C., Feng, K.: An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to fast Algebraic Attacks and Good Nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Chen, Y.: A Construction of Balanced Odd-variable Boolean Function with Optimum Algebraic Immunity. preprint

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Engineering, Shantou University, Shantou, Guangdong, People’s Republic of China

    Yindong Chen

Authors
  1. Yindong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Multimedia Engineering Department, Hannam University, 133 Ojeong-dong, Daeduk-gu, Daejeon, Korea

    Tai-hoon Kim

  2. The Ohio State University, 470 Hitchcock Hall, 2070 Neil Avenue, 43210-1275, Columbus, OH, USA

    Hojjat Adeli

  3. National Chiao Tung University, Hsinchu, Taiwan, R.O.C.

    Wai-chi Fang

  4. Universidad Complutense de Madrid, 28040, Madrid, Spain

    Javier García Villalba

  5. Mississippi State University, Mississippi State, MS, USA

    Kirk P. Arnett

  6. Center of Excellence in Information Assurance, King Saud University, Kingdom of Saudi Arabia

    Muhammad Khurram Khan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y. (2011). A Family Constructions of Odd-Variable Boolean Function with Optimum Algebraic Immunity. In: Kim, Th., Adeli, H., Fang, Wc., Villalba, J.G., Arnett, K.P., Khan, M.K. (eds) Security Technology. SecTech 2011. Communications in Computer and Information Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27189-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27189-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27188-5

  • Online ISBN: 978-3-642-27189-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation