| 摘要 |
Method for parallel key hashing of theoretically proven stability is in fact that information data M are given as sequence М = {m, m,..., m]. Hashing of information data is performed by means of device of bringing to power by module of information data M by iterative law of bringing to power by module of large prime number that is carried out for result of addition by means of third device for adding values of data blocks addresses of which are I parallel calculated as result of adding secret number a and value of counter i (i=1,2,...,t) by means of first device for adding and adding of secret number b and value of counter I by means of second addition device, key data are completed with secret number b and value of counter I by means of second device for adding, key data are completed with secret numbers a and b. Key data K are represented as sequence К = {k, k,... ,k, a, b}. Sum of elements of information sequence m+mis divided into w parts, each u-th (u=1,2,...,w) part is brought to power that is obtained through adding by means of (u+3)-th addition device for adding element of key sequence kand sum of results of bringing to power obtained at previous step by module of simple number р, bringing to power by module of each u-th part of sum of elements of information sequence m+mis performed in parallel. |
