Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / universal hash function, BRW polynomials

Date: received 13 Apr 2017

Contact author: palash at isical ac in

Available format(s): PDF | BibTeX Citation

Version: 20170417:144837 (All versions of this report)

Short URL: ia.cr/2017/328

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]