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

Abstract

The parallel keyed randomizing method consists in feeding M data as sequence, K key data is fed as a k great secret key, a secret number and q secret prime number and information data randomizing is caddied out by means of mi, (i = 1,2,..., t) rasing device elements of M information sequence and K key randomizing sequence by p modulo great prime number iterative rule of addition result value of mi information sequence element and an information sequence element. The exponent to be rased a part of information sequence element is received by adding exponentiation results got on the previous step on (j+1) and j-1)mod w+1) by a modulo raising unit.