You are looking at a specific version 20060806:020208 of this paper.
See the latest version.
Paper 2004/137
New GF(2n) Parallel Multiplier Using Redundant Representation
Haining Fan and Yiqi Dai
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)
- Publication info
- Published elsewhere. This paper is published in: H. Fan, Researches in GF(2n) Multiplication Algorithms, PhD dissertation, Tsinghua University, 2004. (in Chinese)
- Keywords
- Finite fieldnormal basisredundant setMassey-Omura multiplier.
- Contact author(s)
- fan_haining @ yahoo com
- History
- 2006-08-06: last of 3 revisions
- 2004-06-16: received
- See all versions
- Short URL
- https://ia.cr/2004/137
- License
-
CC BY