eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20170417:144837 of this paper.
See the latest version.
Paper 2017/328
Evaluating Bernstein-Rabin-Winograd Polynomials
Debrup Chakraborty and Sebati Ghosh and Palash Sarkar
Abstract
We describe a non-recursive algorithm which can efficiently evaluate Bernstein-Rabin-Winograd polynomials with variable number of blocks.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- universal hash functionBRW polynomials
- Contact author(s)
- palash @ isical ac in
- History
- 2017-11-02: last of 2 revisions
- 2017-04-17: received
- See all versions
- Short URL
- https://ia.cr/2017/328
- License
-
CC BY
