Paper 2025/1224 Original: eprint.iacr.org/2025/1224 ↗
An Update to ``Polynomial Hashing over Prime Order Fields''
Abstract
New state-of-the-art assembly implementations show that BRWHash is consistently faster than polyHash and both t-BRWHash and d-2LHash for all message lengths and for both the primes $2^{127}-1$ and $2^{130}-5$.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2025-07-01: last updated
- 2025-07-01: published
- Short URL
- https://ia.cr/2025/1224
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/1224,
author = {Kaushik Nath and Palash Sarkar},
title = {An Update to ``Polynomial Hashing over Prime Order Fields''},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1224},
year = {2025},
url = {https://eprint.iacr.org/2025/1224}
}