Paper 2023/634
Polynomial Hashing over Prime Order Fields
Abstract
This paper makes a comprehensive study of two important strategies for polynomial hashing over a prime order field
Note: Corrected typos and improved the presentation.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- almost XOR universal hash functionpolynomial hashBRW hash
- Contact author(s)
-
bhattacharyya sreyosi @ gmail com
kaushik nath @ yahoo in
palash @ isical ac in - History
- 2023-10-29: revised
- 2023-05-04: received
- See all versions
- Short URL
- https://ia.cr/2023/634
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/634, author = {Sreyosi Bhattacharyya and Kaushik Nath and Palash Sarkar}, title = {Polynomial Hashing over Prime Order Fields}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/634}, year = {2023}, url = {https://eprint.iacr.org/2023/634} }