| 摘要 |
The keyless hashing method consists in supplying information data M as a sequence M = {}, information data hashing is carried out by means of raising to the power of elementsinformation sequence M in modulus of large prime numberwith the help of a modulo exponentiation engine, where the modulo rasing to the power is carried out, is a hashing result of a previous information sequence element,, initial fillingis open. The modulo prime large numberthe addition result values of information sequence elements, where he addresses is calculated in parallel As an addition result of a constanta counter valueswith the help of the firs modulo addition block and addition of a constantand counter valueswith the help of the second modulo addition block. |
