CryptoDB

Paper: New GF(2n) Parallel Multiplier Using Redundant Representation

Authors: Haining Fan Yiqi Dai URL: http://eprint.iacr.org/2004/137 Search ePrint Search Google 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.
BibTeX
@misc{eprint-2004-12109,
title={New GF(2n) Parallel Multiplier Using Redundant Representation},
booktitle={IACR Eprint archive},
keywords={Finite field, normal basis, redundant set, Massey-Omura multiplier.},
url={http://eprint.iacr.org/2004/137},
note={This paper is published in: H. Fan, Researches in GF(2n) Multiplication Algorithms, PhD dissertation, Tsinghua University, 2004. (in Chinese) fan_haining@yahoo.com 13366 received 7 Jun 2004, last revised 5 Aug 2006},
author={Haining Fan and Yiqi Dai},
year=2004
}