Abstract
This paper deals with reducing the secret key computation time of small scale variants of the AES cipher using algebraic cryptanalysis, which is accelerated by data mining methods. This work is based on the known plaintext attack and aims to speed up the calculation of the secret key by processing the polynomial equations extracted from plaintext-ciphertext pairs. Specifically, we propose to transform the overdefined system of polynomial equations over GF(2) into a new system so that the computation of the Gröbner basis using the F4 algorithm takes less time than in the case of the original system. The main idea is to group similar polynomials into clusters, and for each cluster, sum the two most similar polynomials, resulting in simpler polynomials. We compare different data mining techniques for finding similar polynomials, such as clustering or locality-sensitive hashing (LSH). Experimental results show that using the LSH technique, we get a system of equations for which we can calculate the Gröbner basis the fastest compared to the other methods that we consider in this work. Experimental results also show that the time to calculate the Gröbner basis for the transformed system of equations is significantly reduced compared to the case when the Gröbner basis was calculated from the original non-transformed system. This paper demonstrates that reducing an overdefined system of equations reduces the computation time for finding a secret key.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rijmen, V., Daemen, J.: Advanced encryption standard. Proc. Federal Inf. Process. Stand. Public. Natl. Inst. Stand. Technol. 19, 22 (2001)
Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 392–407. Springer (2000)
Bard, G.: Algebraic cryptanalysis. Springer (2009)
Cid, C., Murphy, S., Robshaw, M.J.B.: Small scale variants of the aes. In: Gilbert, H., Handschuh, H. (eds.) Fast Software Encryption, pp. 145–162. Springer, Berlin (2005). https://doi.org/10.1007/11502760_10
Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 4th edn. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-16721-3
Cid, C., Murphy, S., Robshaw, M.J.: Small scale variants of the aes. In: International Workshop on Fast Software Encryption, pp. 145–162. Springer (2005)
Buchmann, J., Pyshkin, A., Weinmann, R.-P.: A zero-dimensional gröbner basis for aes-128. In: Fast Software Encryption: 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers 13, pp. 78–88. Springer (2006)
Murphy, S., Robshaw, M.J.: Essential algebraic structure within the aes. In: Annual International Cryptology Conference, pp. 1–16. Springer (2002)
Toli, I., Zanoni, A.: An algebraic interpretation of 128. In: International Conference on Advanced Encryption Standard, pp. 84–97. Springer (2004)
Zhao, K., Cui, J., Xie, Z., et al.: Algebraic cryptanalysis scheme of aes-256 using gröbner basis. J. Electric. Comput. Eng. 2017 (2017)
Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 267–287. Springer (2002)
Murphy, S., Robshaw, M.: Comments on the security of the aes and the xsl technique. Electron. Lett. 39(1), 36–38 (2003)
Cid, C., Leurent, G.: An analysis of the xsl algorithm. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 333–352. Springer (2005)
Bulygin, S., Brickenstein, M.: Obtaining and solving systems of equations in key variables only for the small variants of AES. Math. Comput. Sci. 3(2), 185–200 (2010)
Nover, H.: Algebraic cryptanalysis of aes: an overview. University of Wisconsin, USA, pp. 1–16 (2005)
Bielik, M., Jureček, M., Jurečková, O., Lórencz, R.: Yet another algebraic cryptanalysis of small scale variants of aes. In: International Conference on Security and Cryptography (SECRYPT), pp. 415–427 (2022)
Bosma, W., Cannon, J., Playoust, C.: The magma algebra system I: the user language. J. Symb. Comput. 24(3), 235–265 (1997). https://doi.org/10.1006/jsco.1996.0125
Faugére, J.-C.: A new efficient algorithm for computing gröbner bases (f4). J. Pure Appl. Algebra 139(1), 61–88 (1999). https://doi.org/10.1016/S0022-4049(99)00005-5
Cid, C., Murphy, S., Robshaw, M.: Algebraic Aspects of the Advanced Encryption Standard. Springer, New York (2006). https://doi.org/10.1007/978-0-387-36842-9
Bulygin, S., Brickenstein, M.: Obtaining and solving systems of equations in key variables only for the small variants of AES. Math. Comput. Sci. 3(2), 185–200 (2010). https://doi.org/10.1007/s11786-009-0020-y
Kaufman, L., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990). https://doi.org/10.2307/2532178
Lewin, M.: All About XOR. Overload. [cit. 2022-07-01] (2012). https://accu.org/journals/overload/20/109/lewin_1915/
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley (2009)
Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: A survey. CoRR arXiv:1408.2927 (2014) 10.48550/ARXIV.1408.2927 . [cit. 2022-08-27]
Briggs, J.: Faiss: The Missing Manual. [online]. [cit. 2022-07-27]. https://www.pinecone.io/learn/locality-sensitive-hashing/
Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C.: one sugar cube, please or selection strategies in the buchberger algorithm. In: ISSAC 91: International Symposium on Symbolic Algebraic Computation Bonn West Germany, 49–54. Association for Computing Machinery, New York (1991). https://doi.org/10.1145/120694.120701
Brickenstein, M., Dreyer, A.: Polybori: a framework for Gröbner-basis computations with Boolean polynomials. J. Symb. Comput. 44(9), 1326–1345 (2009). https://doi.org/10.1016/j.jsc.2008.02.017
Acknowledgements
This work was supported by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics” and by the Grant Agency of the CTU in Prague, grant No. SGS23/211/OHK3/3T/18 funded by the MEYS of the Czech Republic.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Berušková, J., Jureček, M. & Jurečková, O. Reducing overdefined systems of polynomial equations derived from small scale variants of the AES via data mining methods. J Comput Virol Hack Tech 20, 885–900 (2024). https://doi.org/10.1007/s11416-024-00540-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11416-024-00540-2