1. Science
  2. Publications
  3. Information Processing Systems
  4. 5(103)'2012
  5. Universal hashing functions based on polynomial value computing over rings of integers by modulo 2n

Universal hashing functions based on polynomial value computing over rings of integers by modulo 2n

A.O. Boiko
Annotations languages:

The improvement of universal hashing technique basen on polynomial evaluation over finite fields by using parallel computing is proposed. Improved universal hashing technique is able to increase the speed of computing proportionally to number of CPU cores. Improved universal hashing technique computation parameters can be finely tuned preserving interoperability between systems with different parameters. This article describes developed parallel hashing algorithm. Results of experimental measurements of speed and parallel computation characteristics are also placed here.
Keywords: universal hashing, parallel computing