Paper 2004/137 Original: eprint.iacr.org/2004/137 ↗
New GF(2n) Parallel Multiplier Using Redundant Representation
Abstract
A new GF(2n) redundant representation is presented. Squaring in the representation is almost cost-free. Based on the representation, two multipliers are proposed. The XOR gate complexity of the first multiplier is lower than a recently proposed normal basis multiplier when CN (the complexity of the basis) is larger than 3n-1.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2006-08-06: last updated
- 2004-06-16: published
- Short URL
- https://ia.cr/2004/137
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/137,
author = {Haining Fan and Yiqi Dai},
title = {New GF(2n) Parallel Multiplier Using Redundant Representation},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/137},
year = {2004},
url = {https://eprint.iacr.org/2004/137}
}