The circulant hash revisited (Q2033521)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The circulant hash revisited |
scientific article; zbMATH DE number 7360418
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The circulant hash revisited |
scientific article; zbMATH DE number 7360418 |
Statements
The circulant hash revisited (English)
0 references
17 June 2021
0 references
The authors of this note reinterpret the circulant hash in terms of polynomial arithmetic modulo \(x^n + 1\in {\mathbb F}_2[x]\). This provides simpler proofs to some known results and some implementation possibilities. They also present some variants of the circulant hash and analyze their properties.
0 references
circulant hash
0 references
almost universal hash
0 references
data-dependent rotation
0 references
0 references
0 references
0 references
