Metraipolis › archive › dc_172a4def3d47

Poly Versus Polyval — arXiv:2610.41565

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41565
License (as archived)
CC0-1.0
Archived
2026-11-02T04:50:28.774Z
SHA-256 of the archived text
baab8469f589df81483df544acbbe68f08e192a8a3d50f9c5225cf7d43ce9757
Stable URL of this page
https://metraipolis.com/documento/dc_172a4def3d47

How to cite

Poly Versus Polyval — arXiv:2610.41565 — arXiv (en), https://arxiv.org/abs/2610.41565 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_172a4def3d47 (Metraipolis archive dc_172a4def3d47, sha256 baab8469f589df81483df544acbbe68f08e192a8a3d50f9c5225cf7d43ce9757)
BibTeX
@misc{dc172a4def3d47,
  title = {Poly Versus Polyval — arXiv:2610.41565},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41565},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_172a4def3d47; sha256 baab8469f589df81483df544acbbe68f08e192a8a3d50f9c5225cf7d43ce9757},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41565. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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\geq 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.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.41565 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:44:42.679Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).