Advertisement

Abstract

Algebraic attack is an important attack strategy against symmetric ciphers, particularly stream ciphers. The most vital issue in this attack is to reduce the degree of the algebraic equations as much as possible in order to obtain a lower time complexity. This paper presents one such means of obtaining low degree equations using the decomposition of Boolean functions. This method overcomes the two major drawbacks of fast algebraic attack. We have discussed the general attack strategy using decomposable function. We also demonstrate the decomposition of some Boolean function used in practical stream ciphers. Finally we have given a bound on the degree of a function to be multiplied with a given function so that the product has low degree decomposition.

Keywords

Boolean function Algebraic Attack Fast Algebraic Attack Decomposition of Boolean function 

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: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 65–82. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Cid, C., Kiyomoto, S., Kurihara, J.: The rakaposhi stream cipher. Information and Communications Security, 32–46 (2009)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Courtois, N.T., Klimov, A.B., 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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Courtois, N., O’Neil, S., Quisquater, J.J.: Practical algebraic attacks on the hitag2 stream cipher. In: Information Security, pp. 167–176 (2009)Google Scholar
  7. 7.
    Crama, Y., Hammer, P.L.: Boolean models and methods in mathematics. In: Computer Science and Engineering (2010)Google Scholar
  8. 8.
    Cusick, T.W., Stănică, P.: Cryptographic Boolean functions and applications. Academic Press (2009)Google Scholar
  9. 9.
    Dawson, E., Clark, A., Golic, J., Millan, W., Penna, L., Simpson, L.: The lili-128 keystream generator. In: Proceedings of first NESSIE Workshop (2000)Google Scholar
  10. 10.
    Faugre, J.C.: A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra 139(1-3), 61–88 (1999), http://www-salsa.lip6.fr/~jcf/Papers/F99a.pdf CrossRefMathSciNetGoogle Scholar
  11. 11.
    Faugre, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: International Symposium on Symbolic and Algebraic Computation, pp. 75–83 (2002), http://www-salsa.lip6.fr/~jcf/Papers/F02a.pdf
  12. 12.
    Segers, A.: Algebraic attacks from a gröbner basis perspective. Master’s Thesis (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Dibyendu Roy
    • 1
  • Pratish Datta
    • 1
  • Sourav Mukhopadhyay
    • 1
  1. 1.Department of MathematicsIndian Institute of Technology KharagpurKharagpurIndia

Personalised recommendations