An algebraic approach to fix points of GOST-algorithm

Rok, strany: 2001, 583 - 591

Cryptosystem GOST belongs to DES-like cryptosystems. GOST has been published in [Sistemy obrabotki informacii. Zashchita kryptograficheskaya, Algoritm kriptograficheskogo preobrazovaniya. Gosudarstvennyi Standart Soyuza SSR. GOST: 28147-89, IPK Izdatelstvo standartov, Moskva, 1989], and partially analyzed in [CHARNES, C.—O'CONNOR, L.—PIEPRZYK, J.—% SAFAVI-NAINI, R.—ZHENG, Y.: Comments on Soviet encryption algorithm. Preprint, April 29, 1994]. In this paper we analyze fix points of GOST-algorithm. It is known that there exist $2³²$ fix points when a weak key is in use in this algorithm. But we have never seen any proof of this fact. So we give our brief proof of this property. Using polynomial analysis we show an exact form of these fix points when zero key is active (note that zero key is also a weak key), and all $S$@-boxes are identity permutations. As far as we know such an approach has not been used yet.

ISO 690:

Zanechal, M. 2001. An algebraic approach to fix points of GOST-algorithm. In Mathematica Slovaca, vol. 51, no.5, pp. 583-591. 0139-9918.

APA:

Zanechal, M. (2001). An algebraic approach to fix points of GOST-algorithm. Mathematica Slovaca, 51(5), 583-591. 0139-9918.