Skip to main content

On the Resistance of Boolean Functions against Fast Algebraic Attacks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNSC,volume 7259)

Abstract

Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA’s). It is necessary to study the resistance of Boolean functions against FAA’s. In this paper, we localize the optimal resistance of Boolean functions against FAA’s and introduce the concept of e-fast algebraic immunity (e-FAI) for n-variable Boolean functions against FAA’s, where e is a positive integer and \(1 \leq e<\lceil\frac{n}{2}\rceil\). We give the sufficient and necessary condition of e-FAI. With e-FAI the problem of deciding the resistance of an n-variable Boolean function against FAA’s can be converted into the problem of observing the properties of one given matrix. An algorithm for deciding e-FAI and the optimal resistance against FAA’s is also described.

Keywords

  • stream ciphers
  • algebraic attacks
  • fast algebraic attacks
  • Boolean functions
  • algebraic immunity

This work is supported by Funds of Key Lab of Fujian Province University Network Security and Cryptology (2011008) and National Natural Science Foundations of China (Grant No. 61070168, 10971246, 61003244, 60803135).

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Courtois, N., 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)

    CrossRef  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)

    CrossRef  Google Scholar 

  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)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Li, N., Qi, W.: Boolean functions of an odd number of variables with maximum algebraic immunity. Sci China Ser F-Information Sciences 50(3), 307–317 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. 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)

    CrossRef  Google Scholar 

  6. Liu, M., Pei, D., Du, Y.: Identification and construction of Boolean functions with maximum algebraic immunity. Sci China Ser F-Information Sciences 53(7), 1379–1396 (2010)

    CrossRef  MathSciNet  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  10. 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)

    CrossRef  Google Scholar 

  11. Pasalic, E.: Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 399–414. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  12. Liu, M., Lin, D.: Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions. IEEE Trans. Inform.Theory 57(7), 4817–4821 (2011)

    CrossRef  MathSciNet  Google Scholar 

  13. Rizomiliotis, P.: On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation. IEEE Trans. Inform. Theory 56(8), 4014–4024 (2010)

    CrossRef  MathSciNet  Google Scholar 

  14. Gong, G.: Sequences, DFT and Resistance against Fast Algebraic Attacks. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 197–218. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  15. Canteaut, A.: Open Problems Related to Algebraic Attacks on Stream Ciphers. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 120–134. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, Y., Zhang, F., Liu, M. (2012). On the Resistance of Boolean Functions against Fast Algebraic Attacks. In: Kim, H. (eds) Information Security and Cryptology - ICISC 2011. ICISC 2011. Lecture Notes in Computer Science, vol 7259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31912-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31912-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31911-2

  • Online ISBN: 978-3-642-31912-9

  • eBook Packages: Computer ScienceComputer Science (R0)