TY - JOUR
AU - Chakraborty, Debrup
AU - Ghosh, Sebati
AU - Sarkar, Palash
PY - 2017/03/08
Y2 - 2024/05/30
TI - A Fast Single-Key Two-Level Universal Hash Function
JF - IACR Transactions on Symmetric Cryptology
JA - ToSC
VL - 2017
IS - 1
SE - Articles
DO - 10.13154/tosc.v2017.i1.106-128
UR - https://tosc.iacr.org/index.php/ToSC/article/view/586
SP - 106-128
AB - Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire <em>l</em> − 1 field multiplications for hashing a message consisting of <em>l</em> blocks where each block is one field element. A faster method is based on the class of Bernstein-Rabin-Winograd (BRW) polynomials which require ⌊<em>l</em>/2⌋ multiplications and ⌊lg<em>l</em>⌋ squarings for <em>l</em>≥3 blocks. Though this is significantly smaller than Horner’s rule based hashing, implementation of BRW polynomials for variable length messages present significant difficulties. In this work, we propose a two-level hash function where BRW polynomial based hashing is done at the lower level and Horner’s rule based hashing is done at the higher level. The BRW polynomial based hashing is applied to a fixed number of blocks and hence the difficulties in handling variable length messages is avoided. Even though the hash function has two levels, we show that it is sufficient to use a single field element as the hash key. The basic idea is instantiated to propose two new hash functions, one which hashes a single binary string and the other can hash a vector of binary strings. We describe two actual implementations, one over F<sub>2<sup>128</sup></sub> and the other over F<sub>2<sup>256</sup></sub> both using the pclmulqdq instruction available in modern Intel processors. On both the Haswell and Skylake processors, the implementation over F<sub>2<sup>128</sup></sub> is faster than both an implementation of GHASH by Gueron; and a highly optimised implementation, also by Gueron, of another polynomial based hash function called POLYVAL. We further show that the Fast Fourier Transform based field multiplication over F<sub>2<sup>256</sup></sub> proposed by Bernstein and Chou can be used to evaluate the new hash function at a cost of about at most 46 bit operations per bit of digest, but, unlike the Bernstein-Chou analysis, there is no hidden cost of generating the hash key. More generally, the new idea of building a two-level hash function having a single field element as the hash key can be applied to other finite fields to build new hash functions.
ER -