The circulant hash revisited
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over 𝔽2...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-12-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2018-0054 |
| id |
doaj-744a05522d8e4af6a7e50a6a6d4555c6 |
|---|---|
| record_format |
Article |
| spelling |
doaj-744a05522d8e4af6a7e50a6a6d4555c62021-09-22T06:13:10ZengDe GruyterJournal of Mathematical Cryptology1862-29842020-12-0115125025710.1515/jmc-2018-0054jmc-2018-0054The circulant hash revisitedAraujo Filipe0Neves Samuel1CISUC, Dept. of Informatics Engineering, University of Coimbra, CoimbraPortugalCISUC, Dept. of Informatics Engineering, University of Coimbra, CoimbraPortugalAt ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over 𝔽2. In this paper we revisit the circulant hash and reinterpret it as a multiplication in the polynomial ring 𝔽2[x]/(xn + 1). This leads to simpler proofs, faster implementations in modern computer chips, and newer variants with practical implementation advantages.https://doi.org/10.1515/jmc-2018-0054circulant hashalmost universal hashdata-dependent rotation94a6094a6211t71 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Araujo Filipe Neves Samuel |
| spellingShingle |
Araujo Filipe Neves Samuel The circulant hash revisited Journal of Mathematical Cryptology circulant hash almost universal hash data-dependent rotation 94a60 94a62 11t71 |
| author_facet |
Araujo Filipe Neves Samuel |
| author_sort |
Araujo Filipe |
| title |
The circulant hash revisited |
| title_short |
The circulant hash revisited |
| title_full |
The circulant hash revisited |
| title_fullStr |
The circulant hash revisited |
| title_full_unstemmed |
The circulant hash revisited |
| title_sort |
circulant hash revisited |
| publisher |
De Gruyter |
| series |
Journal of Mathematical Cryptology |
| issn |
1862-2984 |
| publishDate |
2020-12-01 |
| description |
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over 𝔽2. In this paper we revisit the circulant hash and reinterpret it as a multiplication in the polynomial ring 𝔽2[x]/(xn + 1). This leads to simpler proofs, faster implementations in modern computer chips, and newer variants with practical implementation advantages. |
| topic |
circulant hash almost universal hash data-dependent rotation 94a60 94a62 11t71 |
| url |
https://doi.org/10.1515/jmc-2018-0054 |
| work_keys_str_mv |
AT araujofilipe thecirculanthashrevisited AT nevessamuel thecirculanthashrevisited AT araujofilipe circulanthashrevisited AT nevessamuel circulanthashrevisited |
| _version_ |
1717371848212086784 |