TU Darmstadt / ULB / TUbiblio

SoK: Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields

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.-23.05.2024)
doi: 10.1109/SP54263.2024.00132
Conference or Workshop Item, Bibliographie

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.

Item Type: Conference or Workshop Item
Erschienen: 2024
Creators: Degabriele, Jean Paul ; Gilcher, Jan ; Govinden, Jérôme ; Paterson, Kenneth G.
Type of entry: Bibliographie
Title: SoK: Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields
Language: English
Date: 24 May 2024
Publisher: IEEE
Book Title: 2024 IEEE Symposium on Security and Privacy (SP)
Event Title: 45th IEEE Symposium on Security and Privacy
Event Location: San Francisco, USA
Event Dates: 19.-23.05.2024
DOI: 10.1109/SP54263.2024.00132
URL / URN: https://www.computer.org/csdl/proceedings-article/sp/2024/31...
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.

Additional Information:

Art.No.: 131

Divisions: 20 Department of Computer Science
20 Department of Computer Science > Cryptography and Complexity Theory
Profile Areas
Profile Areas > Cybersecurity (CYSEC)
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CRISP - Center for Research in Security and Privacy
Date Deposited: 20 Mar 2024 15:30
Last Modified: 20 Mar 2024 15:30
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details