Спосіб ключового хешування

Abstract

The key hashing method consists in feeding information data M as M={m1, m2,..., mt}sequence, key data K is fed as a secret number k and a personal key k*, secret numbers a and b. Information data hashing is carried out by means of a mi module of element exponentiation engine information sequence M and key sequence K elements. They are raised to the power which (mi-a+mi-b) part of mi, information sequence element values are defined as a result of addition of information sequence element values, the addresses being calculated as a result of addition of the secret number a and a counter value i by means of the second addition block, addition of a secret number b and a counter value i by means of the third addition block, modulo great prime number p. The exponent to be raised is obtained by means of addition of a personal key k* and a result of the previous hashing iteration by means of the sixth addition block. An information sequence element is added to the part of the (mi-a+mi-b) value of valuated amount of mi information sequence elements, the address being calculated as a result of addition of ui number calculated as a pseudo-random number generator state, the state preceded, equal to mi, information sequence element value and i counter value by means of the first addition block.