跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2507.06490 · v3

Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields

首次提交 2025-07-09 10:27
版本更新 2026-11-15 20:29
雷达观测 2026-11-17 19:15
arXiv ↗PDF ↗

摘要

We introduce the new AXU hash function decBRWHash, which is parameterised by the positive integer cc and is based on Bernstein-Rabin-Winograd (BRW) polynomials. Choosing c>1c>1 gives a hash function which can be implemented using cc-way single instruction multiple data (SIMD) instructions. We report a set of very comprehensive hand optimised assembly implementations of 4-decBRWHash using avx2 SIMD instructions available on modern Intel processors. For comparison, we also report similar carefully optimised avx2 assembly implementations of polyHash, an AXU hash function based on usual polynomials. Our implementations are over prime order fields, specifically the primes 2127−12^{127}-1 and 2130−52^{130}-5. For the prime 2130−52^{130}-5, for avx2 implementations, compared to the famous Poly1305 hash function, 4-decBRWHash is faster for messages which are a few hundred bytes long and achieves a speed-up of about 16% for message lengths in a few kilobytes range and improves to a speed-up of about 23% for message lengths in a few megabytes range.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-15 20:29 · 最新观测版本

Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields

We introduce the new AXU hash function decBRWHash, which is parameterised by the positive integer cc and is based on Bernstein-Rabin-Winograd (BRW) polynomials. Choosing c>1c>1 gives a hash function which can be implemented using cc-way single instruction multiple data (SIMD) instructions. We report a set of very comprehensive hand optimised assembly implementations of 4-decBRWHash using avx2 SIMD instructions available on modern Intel processors. For comparison, we also report similar carefully optimised avx2 assembly implementations of polyHash, an AXU hash function based on usual polynomials. Our implementations are over prime order fields, specifically the primes 2127−12^{127}-1 and 2130−52^{130}-5. For the prime 2130−52^{130}-5, for avx2 implementations, compared to the famous Poly1305 hash function, 4-decBRWHash is faster for messages which are a few hundred bytes long and achieves a speed-up of about 16% for message lengths in a few kilobytes range and improves to a speed-up of about 23% for message lengths in a few megabytes range.

查看此版本解读 →查看此版本原文 ↗