Efficient normal basis multipliers in composite fields

Sangho Oh; Chang Han Kim; Jongin Lim; Dong Hyeon Cheon

doi:10.1109/12.888054

Efficient normal basis multipliers in composite fields

Sangho Oh, Chang Han Kim, Jongin Lim, Dong Hyeon Cheon

School of Cybersecurity

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

Abstract

It is well-known that a class of finite fields GF(2ⁿ) 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.

Original language	English
Pages (from-to)	1133-1138
Number of pages	6
Journal	IEEE Transactions on Computers
Volume	49
Issue number	10
DOIs	https://doi.org/10.1109/12.888054
Publication status	Published - 2000 Oct

Bibliographical note

Funding Information:
This paper was partially supported by the Korea Information Security Agency.

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.888054

Cite this

@article{283dc9e791714bc09e47fb75ae15db4b,

title = "Efficient normal basis multipliers in composite fields",

abstract = "It is well-known that a class of finite fields GF(2n) 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.",

author = "Sangho Oh and Kim, {Chang Han} and Jongin Lim and Cheon, {Dong Hyeon}",

note = "Funding Information: This paper was partially supported by the Korea Information Security Agency.",

year = "2000",

month = oct,

doi = "10.1109/12.888054",

language = "English",

volume = "49",

pages = "1133--1138",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - Efficient normal basis multipliers in composite fields

AU - Oh, Sangho

AU - Kim, Chang Han

AU - Lim, Jongin

AU - Cheon, Dong Hyeon

N1 - Funding Information: This paper was partially supported by the Korea Information Security Agency.

PY - 2000/10

Y1 - 2000/10

N2 - It is well-known that a class of finite fields GF(2n) 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.

AB - It is well-known that a class of finite fields GF(2n) 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.

UR - http://www.scopus.com/inward/record.url?scp=0034291075&partnerID=8YFLogxK

U2 - 10.1109/12.888054

DO - 10.1109/12.888054

M3 - Article

AN - SCOPUS:0034291075

SN - 0018-9340

VL - 49

SP - 1133

EP - 1138

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 10

ER -

Efficient normal basis multipliers in composite fields

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this