Paper 2014/687
Reducing the Complexity of Normal Basis Multiplication
Omer Egecioglu and Cetin Kaya Koc
Abstract
In this paper we introduce a new transformation method and a multiplication
algorithm for multiplying the elements of the field GF
Note: Accepted to WAIFI 2014.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Finite fieldscharacteristic 2normal basisoptimal normal basis
- Contact author(s)
- koc @ cs ucsb edu
- History
- 2014-09-04: received
- Short URL
- https://ia.cr/2014/687
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/687, author = {Omer Egecioglu and Cetin Kaya Koc}, title = {Reducing the Complexity of Normal Basis Multiplication}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/687}, year = {2014}, url = {https://eprint.iacr.org/2014/687} }