Abstract
In an algebraic attack on a cipher, one expresses the encryption function as a system (usually overdefined) of multivariate polynomial equations in the bits of the plaintext, the ciphertext and the key, and subsequently solves the system for the unknown key bits from the knowledge of one or more plaintext/ciphertext pairs. The standard eXtended Linearization algorithm (XL) expands the initial system of equations by monomial multiplications. The expanded system is treated as a linear system in the monomials. For most block ciphers (like the Advanced Encryption Standard (AES)), the size of the linearized system turns out to be very large, and consequently, the complexity to solve the system often exceeds the complexity of brute-force search. In this paper, we propose a heuristic strategy XL_SGE to reduce the number of linearized equations. This reduction is achieved by applying structured Gaussian elimination before each stage of monomial multiplication. Experimentation on small random systems indicates that XL_SGE has the potential to improve the performance of the XL algorithm in terms of the size of the final solvable system. This performance gain is exhibited by our heuristic also in the case of a toy version of AES.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28, 657–715 (1949)
Faugère, J.C.: A new efficient algorithm for computing Gröbner basis (F4). Journal of Pure and Applied Algebra 139(1), 61–88 (1999)
Faugère, J.C.: A new efficient algorithm for computing Gröbner basis without reduction to zero (F5). In: ISSAC 2002, pp. 75–83 (2002)
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)
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)
Courtois, N., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 267–287. Springer, Heidelberg (2002)
Ding, J., Buchmann, J., Mohamed, M., Moahmed, W., Weinmann, R.: Mutantxl. In: SCC, pp. 16–22 (2008)
Bard, G., Courtois, N., Jefferson, C.: Solution of sparse polynomial systems over GF(2) via sat-solvers. In: ECRYPT workshop Tools for Cryptanalysis (2007)
Courtois, N., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: IMA Int. Conf., pp. 152–169 (2007)
Courtois, N., Bard, G.V., Wagner, D.: Algebraic and slide attacks on keeLoq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 97–115. Springer, Heidelberg (2008)
Courtois, N., O’Neil, S., Quisquater, J.J.: Practical algebraic attacks on the hitag2 stream cipher. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 167–176. Springer, Heidelberg (2009)
Vörös, M.: Algebraic attack on stream ciphers. Master’s thesis, Comenius University, Faculty of Mathematics, Physics and Informatics, Department of Computer Science (2007)
LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109–133. Springer, Heidelberg (1991)
Daemen, J., Rijmen, V.: Rijndael for AES. In: AES Candidate Conference, pp. 343–348 (2000)
Kleiman, E.: The XL and XSL attacks on Baby Rijndael. Master’s thesis, Iowa State University, Department of Mathematics (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, S., Das, A. (2011). An Improvement of Linearization-Based Algebraic Attacks. In: Joye, M., Mukhopadhyay, D., Tunstall, M. (eds) Security Aspects in Information Technology. InfoSecHiComNet 2011. Lecture Notes in Computer Science, vol 7011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24586-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-24586-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24585-5
Online ISBN: 978-3-642-24586-2
eBook Packages: Computer ScienceComputer Science (R0)