Paper 2014/687 Original: eprint.iacr.org/2014/687 ↗
Reducing the Complexity of Normal Basis Multiplication
Abstract
In this paper we introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF$(2^k)$ expressed in a normal basis. The number of XOR gates for the proposed multiplication algorithm is fewer than that of the optimal normal basis multiplication, not taking into account the cost of forward and backward transformations. The algorithm is more suitable for applications in which tens or hundreds of field multiplications are performed before needing to transform the results back.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2014-09-04: last updated
- 2014-09-04: published
- Short URL
- https://ia.cr/2014/687
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}