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

Abstract

A method for parallel keyed hashing consists in supplying information data M as M={m1,m2,...,ml}, sequence, information data hashing is carried out by rasing to the power of information data M with respect to a big prime by means of a device for modulo rasing to the power to be carried out for an addition result with the help of the third addition device of data unit values, the addresses being calculated in parallel as an addition result of a secret number a and counter I (i=1, 2, ..., l) values by means of the first addition device and addition of a secret number b and counter i values with the help of the second addition. The key data is added by secret numbers a and b, key data K represents as K={k1, k2,..., kq, a, b}sequences and information sequence sum of elements mi-a + mi-b are divided into q parts. Each j- (j=1, 2 ,..., q) part of (mi-a + mi-b)j is modulo raised to the power of a big prime pj. The exponent to be raised to the power is derived by means of addition with the help of (j+3)-addition device of keyed sequence elements kj and integration result of h*i-1 raisin to the power results with respect to a big prime, derived on a previous step. The modulo rasing to the power of each j-part of mi-a + mi-b information sequence elements of the sum is carried out in parallel where the integration of modulo raising to the power is derived by means of all values hi-1j of modulo raising to the power results of mi-a + mi-b information sequence elements of the sum. The resulting hash values are integration result h*l of modulo raising to the power results derived following the last iteration.