2 General description of гост 28147-89 algorithm

An algorithm is carried by the name ГОСТ 28147-89. It is intended for hardware and programmatic representation, suits, to produced for modern cryptosystems, and does not lay on limits on secrecy of transferable information.

As well as DES algorithm, the ГОСТ algorithm is built on the basis of Feystel network. On every stage the encoded report is broken up to left L₀ and to right R₀ parts which cipher by rule

L_i = R_i-1

R_i = L_{i -1} f(R_i-1 ,K_i),

K_i

f(R_i-1 ,K_i)

Realization of network of Feystel in an algorithm ГОСТ 28147-89

utillizing the intermediate value of the key Ki.

A difference consists of that in place of the 64-bit key 256-bit key is utilized.

An amount of the stages of encypherement is twice as much as compared to DES.

In addition, operation of replacement, carried out of S-blocks is not permanent, but can change as necessary and, in addition, it is assumed to keep it in secret, that equivalently to lengthening of the key, practically to 610 bits.

Finally, the ГОСТ algorithm is utillized nonlinear function f_ГОСТ , which substantially differs from the function of f_DES , wich is applied in the DES algorithm.

Before to begin consideration of the modes of operations of ГОСТ algorithm, it is necessary to be stopped for the features of some operations, in-use at implementation of nonlinear function of f. It at first, adding up on the module 2 ⁿ and, secondly adding up on the module of 2 ⁿ - 1.

Operation of adding up of numbers a and b on the module of 2ⁿ supposes that

a + b (mod 2 ⁿ) = a + b, if a + b < 2 ⁿ

a + b (mod 2 ⁿ) = a + b - 2 ⁿ, if a + b > 2 ⁿ

In this algorithm these operations are executed above numbers, presented in a binary code. We will consider the example of addition of numbers 13 and 9 on the module of 2 ⁿ at n = 4.

 1101 13 + 9 = 22; 2 ⁿ = 16; 22 - 16 = 6

1001

---------------

10110

From this example evidently, that for the receipt of the sought result, from the result of addition it is necessary to cast away a most significant digit. Self addition must be carried out with the transfer of unit in a most significant digit.

Addition on the module 2 ⁿ - 1 carried out by rule.

a + b (mod 2 ⁿ - 1) = a + b, if a + b < 2 ⁿ - 1

a + b (mod 2 ⁿ - 1) = a + b - 2 ⁿ - 1, if a + b > 2 ⁿ - 1

We will consider the example of addition of numbers 13 and 9 on the module 2 ⁿ - 1 at n = 4.

 1101 13 + 9 = 22; 2 ⁿ - 1 = 15; 22 - 15 = 7;  0110

1001 0001

--------------- ------------

10110 0111

From this example evidently, that for the receipt of the sought result, from the result of addition it is necessary to cast away a most significant digit and add unit to the got remain.

This algorithm is entended a few modes of work. To their number behave, mode of simple replacements, mode of gamming, mode of gamming with a feed-back and mode of making of imito-insertion.

Mode of simple replacement are intended by dividing of the encoded sequence into blocks long in 64 digits and is component part of other modes of encipherement. This mode can be utillized only for the encipherement of blocks length of which is multiple 64th bits. On this account it is used only for the transmission of the next key.

The modes of gamming and gamming with a feed-back are ordinary operating modes and them, mainly, apply for the encipherement of dates.

The mode of forming of imito-insertion is intended for forming of signatury, necessary for the digital signature of electronic documents.