Poly Versus Polyval

arXiv:2610.41565 · cs.CR · Submitted 2026-10-30 · Read on arXiv

cs.CR

Submitted: 2026-10-30

Updated: 2026-10-30

Code: https://github.com/kn-cs/poly_vs_polyval

License: http://creativecommons.org/licenses/by/4.0/

The gist: We revisit the basic construction of polynomial evaluation based hash function, which we call Poly, over binary extension fields over GF(2 n), where n=64k and k at least 2.

Terminology

Abstract

We revisit the basic construction of polynomial evaluation based hash function, which we call Poly, over binary extension fields over GF(2 n), where n=64k and k at least 2. Unlike GHASH, the NIST standard polynomial evaluation based hash function for n=128, Poly does not perform the unnecessary bit reversals of each n-bit block, and consequently is faster than GHASH. Further, Poly differs from Polyval, -- a faster alternative to GHASH, -- in that Poly performs usual reduction, while Polyval performs Montgomery reduction. We identify suitable choices of the field representing irreducible polynomials which makes usual and Montgomery reductions efficient. We provide detailed algorithms, and associated proofs of correctness for both kinds of reductions. Based on the algorithms, we report carefully optimised assembly implementation of both Poly and Polyval for n=128,256 and 512. Our theoretical analysis and experimental timing results show that for n=128, Polyval is faster than Poly, while for n=256 and 512 (as well as for higher values of n), Poly is faster than Polyval. The cases n=128 and 256 are of current relevance due to the ongoing NIST process for developing cryptographic accordions.

Related papers