| 摘要 |
Method for parallel key hashing of theoretically proved stability includes presentation of information data М as sequence М = {,, ...}. Key data K are given as large secret key, secret numberand secret simple number. Hashing of information data is carried out by means of device for bringing to power elements(= 1, 2, ...,) of information sequence М and elements of key sequence K by iterative law of bringing to power by module of large simple number p of result of adding s of value of element of information sequenceand value of element of information sequence number of which differs fromby number that is calculated by means of device for bringing to power as result of bringing to powerof value of element of information sequenceby module. Large secret keyis represented as sequence= {,, ...,}. Result of addingis divided intoparts each of which(= 1, 2, ...,) is I parallel brought to power on devices for bringing to power that is obtained by means of adding, by means of adding device, of element of key sequenceand sum of results of bringing to power calculated by means of device for adding obtained on previous step by module of simple number. |
