METHOD FOR HASHING INFORMATION Russian patent published in 2021 - IPC G06F7/58 H04L9/00 

FIELD: hashing information.

SUBSTANCE: method involves splitting the input row M into n r-bit blocks of fixed lengths M1, M2, … M_n; addition, if necessary, of the last block M_n up to the length multiple of the block bit; performing n iterations of entering information using the nonlinear function F(F_i-1, M_i), where i=1, 2, 3, … , n; F₀=F(IV), IV is an initialization vector; performing d≥0 iterations of information processing F_j=F(F_(j-1)); where j=1, 2, 3, … , d; F₀ is the result of the last iteration of the input; performing k≥0 iterations of information output F_t=F(F_(t-1))=F(F_r(t-1)||F_c(t-1)); t=1, 2, 3, … , k; where F_r(t-1) and F_c(t-1) are, respectively, r minor and c major bits of the result of the (t-1)-th iteration of information processing, F_r0 and F_c0 are, respectively, r minor and c major bits of the result of the last iteration of information processing. After that, the concatenation of r minor bits of the result of the last iteration of information processing and r minor bits of the results of all iterations of information output F_r0||F_r1||F_r2||…||F_rk is declared as the result of hashing, i.e., the hash image of the row M. When performing each i-th iteration of information input, a block of three-input multi-round stochastic data transformation R(A, B, C) is used, where A is the transformed data block, B is the transformation parameter, C is the parameter of round transformations. The input iteration is performed according to the formula F_i=F(R(M_i,F_r(i-1),F_c(i-1)||F_c(i-1)); where F_r(i-1) is the r minor bits of the result of the previous (i-1)-th iteration, F_c(i-1) is the c major bits of the result of the previous (i-1)-th iteration, F₀=F_r0||F_c0=F(IV), IV is the initialization vector, and || is the concatenation operation.

EFFECT: increased cryptographic strength of hashing.

1 cl, 6 dwg