Paper 2012/414
Low complexity bit-parallel multiplier for all-one polynomials
Yin Li, Gong-liang Chen, and Xiao-ning Xie
Abstract
This paper presents a new bit-parallel multiplier for the finite
field
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- foundations
- Contact author(s)
- yunfeiyangli @ gmail com
- History
- 2012-08-01: received
- Short URL
- https://ia.cr/2012/414
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/414, author = {Yin Li and Gong-liang Chen and Xiao-ning Xie}, title = {Low complexity bit-parallel ${GF}(2^m)$ multiplier for all-one polynomials}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/414}, year = {2012}, url = {https://eprint.iacr.org/2012/414} }