Tokens are encrypted twice using GOST R 34 series algorithms. The algorithms form a unique sequence of numbers on the basis of which key pairs are generated. Therefore, in the group of all possible solutions the keys are always unique.
Lets compare the durability of the algorithm GOST R 34 with SHA-256, which is used in Bitcoin.
SHA-256 can be hacked with the help of modern technologies: in 2008 Somitra Kumar Sanadia and
Palash Sarkar published the collisions they found for 22 iterations. After that programmers found ways to crack 31 more iteration of SHA-256.
The GOST R 34 series cipher is not a Feistel network, but an SP-network: data transformation consists of several identical rounds. Each round consists of a nonlinear and linear transformation, as well as a key overlay operation. Unlike the Feistel network, when using an SP network, the entire input block is converted, not its half.
Peculiarities of the algorithm:
🔹Linear transformation can be implemented using a shift register;
🔹Key scan is implemented using a Feistel network, which uses the round transformation of the original algorithm as a function;
🔹Input block length-128 bits, key length-256 bits. Private keys are stored in the encrypted area.
