Faugère, J.-C. (2002) A New Efficient Algorithm for Computing Gr?bner Bases without Reduction to Zero (F5). Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC’02), Association for Computing Machinery, Inc., New York, 75-83.

has been cited by the following article:

• TITLE: Algebraic Cryptanalysis of GOST Encryption Algorithm

  AUTHORS: Ludmila Babenko, Ekaterina Maro

  KEYWORDS: Encryption Algorithm GOST; GOST; S-Box; Systems of Multivariate Quadratic Equations; Algebraic Cryptanalysis; Extended Linearization Method; Gaussian Elimination

  JOURNAL NAME: Journal of Computer and Communications, Vol.2 No.4, March 17, 2014

  ABSTRACT: This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic analysis is based on the representation of initial encryption algorithm as a system of multivariate quadratic equations, which define relations between a secret key and a cipher text. Extended linearization method is evaluated as a method for solving the nonlinear sys- tem of equations.