Paper 2026/1602

New Designs of Multivariate-Polynomial Universal Hash Functions

Jean Paul Degabriele, Technology Innovation Institute
Jan Gilcher, ETH Zurich
Jérôme Govinden, Technology Innovation Institute
Kenneth G. Paterson, ETH Zurich
Abstract

Universal hash functions (UHFs) are basic building blocks in cryptography, making the topic of designing secure, fast UHFs of longstanding interest. This paper presents an exploration of the design space for multivariate UHFs, that is UHFs that involve the evaluation of a multivariate polynomial over a finite field. We focus on two-level designs, wherein a lower-level hash function produces intermediate values that are consumed by a higher-level one, and where both hash functions are based on either univariate or multivariate polynomials. This approach allows designs to benefit from the desirable features of both components and thereby strike new trade-offs between key size, security level, and amenability to optimization techniques. We extend the recent UHF code generation and benchmarking framework of Degabriele et al. (IEEE S&P 2024) to accommodate our multivariate designs (and also to support binary field arithmetic). We then use the framework to study the performance of a large collection of new two-level designs. This is done by first conducting a statistical factor analysis to determine which design features (and combinations of those features) most influence performance, and then using it to identify particular combinations of lower-level and higher-level hash functions offering particularly good performance/security trade-offs. We present new designs for both binary and prime fields, at two different security levels (corresponding to roughly 128 and 256 bits of security). Our best designs have performance that significantly outperforms state-of-the-art UHFs in the research literature and as deployed in mainstream cryptography libraries by up to 25%, resulting in 0.3 cycles/byte for 128-bit binary fields. We expect further gains from optimizations such as vectorization, as our benchmarks rely purely on auto-generated code from the extended framework, while state-of-the-art implementations typically use hand-optimized implementation strategies. We conclude with a brief inquiry into the performance implications of employing our best UHF design in the AEAD and Accordion mode designs currently under consideration for standardization by NIST.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Major revision. ACM CCS 2026
Keywords
Universal Hash FunctionsPolynomial Hash FunctionsMultivariate PolynomialsPerformance AnalysisRijndael256AEAD
Contact author(s)
jeanpaul degabriele @ tii ae
jan gilcher @ inf ethz ch
jerome govinden @ tii ae
kenny paterson @ inf ethz ch
History
2026-08-06: approved
2026-08-04: received
See all versions
Short URL
https://ia.cr/2026/1602
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/1602,
      author = {Jean Paul Degabriele and Jan Gilcher and Jérôme Govinden and Kenneth G. Paterson},
      title = {New Designs of Multivariate-Polynomial Universal Hash Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1602},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1602}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.