1. Science
  2. Publications
  3. Information Processing Systems
  4. 3(101)'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 method of universal hashing based on polynomial evaluation over rings of integers by modulo 2n is proposed. Cascading scheme is proposed for solution of problem of weak keys.
Keywords: universal hashing, transformations over rings, weak keys, polynom