Degabriele, Jean Paul ; Gilcher, Jan ; Govinden, Jérôme ; Paterson, Kenneth G. (2024)
SoK: Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields.
45th IEEE Symposium on Security and Privacy. San Francisco, USA (19.05.2024-23.05.2024)
doi: https://doi.ieeecomputersociety.org/10.1109/SP54263.2024.00132
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

Poly1305 is a widely-deployed polynomial hash function. The rationale behind its design was laid out in a series of papers by Bernstein, the last of which dates back to 2005. As computer architectures evolved, some of its design features became less relevant, but implementers found new ways of exploiting these features to boost its performance. However, would we still converge to this same design if we started afresh with today’s computer architectures and applications? To answer this question, we gather and systematize a body of knowledge concerning polynomial hash design and implementation that is spread across research papers, cryptographic libraries, and developers’ blogs. We develop a framework to automate the validation and benchmarking of the ideas that we collect. This approach leads us to five new candidate designs for polynomial hash functions. Using our framework, we generate and evaluate different implementations and optimization strategies for each candidate. We obtain substantial improvements over Poly1305 in terms of security and performance. Besides laying out the rationale behind our new designs, our paper serves as a reference for efficiently implementing polynomial hash functions, including Poly1305.

Frage zum Eintrag

Redaktionelle Details anzeigen