Table of Contents Author Guidelines Submit a Manuscript
Journal of Electrical and Computer Engineering
Volume 2017, Article ID 9828967, 9 pages
https://doi.org/10.1155/2017/9828967
Research Article

Algebraic Cryptanalysis Scheme of AES-256 Using Gröbner Basis

1Department of Computer Science and Technology, Henan Institute of Technology, Xinxiang 453003, China
2School of Computer Science and Technology, Anhui University, Hefei 230039, China

Correspondence should be addressed to Jie Cui; nc.ude.ctsu.liam@eijiuc

Received 22 October 2016; Accepted 22 January 2017; Published 23 February 2017

Academic Editor: Jucheng Yang

Copyright © 2017 Kaixin Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Daemen and V. Rijmen, The Design of Rijndael: AES—The Advanced Encryption Standard, Springer Science & Business Media, 2013.
  2. A. Hashemi and D. Lazard, “Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving,” International Journal of Algebra and Computation, vol. 21, no. 5, pp. 703–713, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. Bardet, J.-C. Faugère, and B. Salvy, “On the complexity of the F5 Gröbner basis algorithm,” Journal of Symbolic Computation, vol. 70, pp. 49–70, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. A. Bogdanov and V. Rijmen, “Linear hulls with correlation zero and linear cryptanalysis of block ciphers,” Designs, Codes and Cryptography, vol. 70, no. 3, pp. 369–383, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. Y. Sasaki, “Known-key attacks on rijndael with large blocks and strengthening shiftrow parameter,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 95, no. 1, pp. 21–28, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. C. Cid and G. Leurent, “An Analysis of the XSL Algorithm,” in Advances in cryptology—ASIACRYPT 2005, vol. 3788 of Lecture Notes in Comput. Sci., pp. 333–352, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. S. Murphy and M. Robshaw, “Comments on the security of the AES and the XSL technique,” Electronic Letters, vol. 39, no. 1, pp. 36–38, 2003. View at Publisher · View at Google Scholar
  8. J. Buchmann, A. Pyshkin, and R.-P. Weinmann, “A zero-dimensional Gröbner basis for AES-128,” Lecture Notes in Computer Science, vol. 4047, pp. 78–88, 2006. View at Google Scholar · View at Scopus
  9. S. Ghosh and A. Das, “An improvement of linearization-based algebraic attacks,” in Security Aspects in Information Technology, vol. 7011 of Lecture Notes in Computer Science, pp. 157–167, Springer, 2011. View at Publisher · View at Google Scholar
  10. M. R. Z'Aba, K. Wong, E. Dawson, and L. Simpson, “Algebraic analysis of small scale LEX-BES,” in Proceedings of the 2nd International Cryptology Conference: Curve is an Art, Cryptology is a Science (Cryptology '10), pp. 77–82, Universiti Teknikal Malaysia Melaka, Melaka, Malaysia, July 2010. View at Scopus
  11. J. Cui, L. Huang, H. Zhong, and W. Yang, “Algebraic attack on Rijndael-192 based on Grobner basis,” Acta Electronica Sinica, vol. 41, no. 5, pp. 833–839, 2013. View at Google Scholar
  12. S. N. Ahmad and N. Aris, “The Gröbner package in Maple and computer algebra system for solving multivariate polynomial equations,” Academic Journal UiTM Johor, vol. 10, pp. 156–174, 2011. View at Google Scholar
  13. M. Bardet, J. C. Faugere, and B. Salvy, “On the complexity of the F5 Gröbner basis algorithm,” Journal of Symbolic Computation, vol. 70, pp. 49–70, 2015. View at Google Scholar
  14. V. Gerdt and R. La Scala, “Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals,” Journal of Algebra, vol. 423, pp. 1233–1261, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. Buchmann, A. Pyshkin, and R.-P. Weinmann, “Block ciphers sensitive to Gröbner basis attacks,” in Topics in Cryptology—CT-RSA 2006, vol. 3860 of Lecture Notes in Comput. Sci., pp. 313–331, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. D.-M. Li, J.-W. Liu, and W.-J. Liu, “W-Gröbner basis and monomial ideals under polynomial composition,” Applied Mathematics A, vol. 26, no. 3, pp. 287–294, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J.-C. Faugère and A. Joux, “Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases,” in Proceedings of the Annual International Cryptology Conference (CRYPTO '03), vol. 2729 of Lecture Notes in Computer Science LNCS, pp. 44–60, Springer, Santa Barbara, Calif, USA, 2003.