zbMATH — the first resource for mathematics

An algebraic approach to fix points of GOST-algorithm. (English) Zbl 1004.68065
Assuming a special case with the zero key, and all S-boxes being identity mappings, there is a nice algebraic method for finding all weak keys. Moreover, this method is applicable not only for 11 bits rotation but for any possible rotation in GOST round function. To what extent this method is applicable to arbitrary Feistel-like cryptosystem is not clear from the paper.

68P25 Data encryption (aspects in computer science)
94A60 Cryptography
Full Text: EuDML
[1] CHARNES C.-O’CONNOR L.-PIEPRZYK J.-SAFAVI-NAINI R.-ZHENG Y.: Comments on Soviet encryption algorithm. Preprint, April 29, 1994. · Zbl 0879.94033
[2] Sistemy obrabotki informacii. Zashchita kryptograficheskaya, Algoritm kriptograficheskogo preobrazovaniya. Gosudarstvennyi Standart Soyuza SSR, GOST: 28147-89, IPK Izdatelstvo standartov, Moskva, 1989.
[3] Cryptographic Protection for Data Processing Systems. Cryptographic Transformation Algorithm. Government Standard of the U.S.S.R., GOST: 28147-89 (
[4] GROŠEK O.- NEMOGA K.-ZANECHAL M.: Why to use bijective \(S\)-boxes in the \(GOST\) ciphering algorithm. Informatica, Ljubljana (Slovenia)
[5] KELSEY J.-SCHNEIER B.-WAGNER D.: Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES. Advances in Cryptology - CRYPTO ’96. Lecture Notes in Comput. Sci. 1109, Springer-Verlag, Berlin, 1996. · Zbl 1329.94066
[6] PIEPRZYK J.-TOMBAK L. : Soviet encryption algorithm. Preprint, November 24, 1993 and June 1, 1994.
[7] SCHNEIER B.: Applied Cryptography. (2nd, J. Wiley k, Sons, New York, 1996. · Zbl 0883.94001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.