Efficient normal basis multipliers in composite fields

It is well-known that a class of finite fields GF(2/sup n/) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. 49; no. 10; pp. 1133 - 1138
Main Authors:	Oh, Sangho, Kim, Chang Han, Lim, Jongin, Cheon, Dong Hyeon
Format:	Journal Article
Language:	English
Published:	New York IEEE 01-10-2000 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Architecture Arithmetic Elliptic curve cryptography Elliptic curves Galois fields Hardware Mathematical analysis Multipliers Optimization Polynomials Public key cryptography Representations
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	It is well-known that a class of finite fields GF(2/sup n/) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0018-9340 1557-9956
DOI:	10.1109/12.888054