| 摘要 |
Method for parallel key hashing of theoretically proved stability is in fact that information data M are given as sequence М={m, m, ..., m}, and information data hashing M is carried out by means of device for multiplication of elements of information sequence and elements of key sequence K by iteration law of bringing to degree of value of element of information sequence by module of prime number, degree to with bringing up is performed is obtained through adding personal key and result of previous iteration of hashing by means of addition device. Key data K are presented as sequence К={k, k, ..., k}, and element of information sequence m(i=1, 2, ..., t) is split to w parts each of which m(u=1, 2, ..., w) is brought to degree obtained through adding by means of u-th device of element of key sequence kand sum of results of bringing to degree obtained at previous step by module of prime number р, bringing to degree by module of each part mof element of information sequence min performed in parallel. |
