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.
universal hashing, transformations over rings, weak keys, polynom
"Universalni funktsii heshuvannia na osnovi obchyslennia znachennia polinoma v kiltsiakh tsilykh chysel za modulem 2n" ,
Information Processing Systems,