Paper 2011/161
Efficient Hardware Implementations of BRW Polynomials and Tweakable Enciphering Schemes
Debrup Chakraborty, Cuauhtemoc Mancillas-Lopez, Francisco Rodriguez-Henriquez, and Palash Sarkar
Abstract
A new class of polynomials was introduced by Bernstein (Bernstein 2007) which were later named by Sarkar as Bernstein-Rabin-Winograd (BRW) polynomials (Sarkar 2009). For the purpose of authentication, BRW polynomials offer considerable computational advantage over usual polynomials:
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Pipelined architecturetweakable enciphering schemesKaratsuba multiplierdisc encryptionpolynomial evaluation
- Contact author(s)
- debrup @ cs cinvestav mx
- History
- 2011-03-31: received
- Short URL
- https://ia.cr/2011/161
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/161, author = {Debrup Chakraborty and Cuauhtemoc Mancillas-Lopez and Francisco Rodriguez-Henriquez and Palash Sarkar}, title = {Efficient Hardware Implementations of {BRW} Polynomials and Tweakable Enciphering Schemes}, howpublished = {Cryptology {ePrint} Archive, Paper 2011/161}, year = {2011}, url = {https://eprint.iacr.org/2011/161} }