A new hardware architecture for operations in GF(2n)

Chang Han Kim; Sangho Oh; Jongin Lim

doi:10.1109/12.980019

A new hardware architecture for operations in GF(2ⁿ)

Chang Han Kim, Sangho Oh, Jongin Lim

School of Cybersecurity

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

6 Citations (Scopus)

Abstract

The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis [8] and present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier [2] using the type I optimal normal basis.

Original language	English
Pages (from-to)	90-92
Number of pages	3
Journal	IEEE Transactions on Computers
Volume	51
Issue number	1
DOIs	https://doi.org/10.1109/12.980019
Publication status	Published - 2002 Jan

Keywords

Elliptic curve
Finite fields
Nonconventional basis
Public-key cryptosystems

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.980019

Cite this

@article{527106d5a8c543d2941c0def9449dc50,

title = "A new hardware architecture for operations in GF(2n)",

abstract = "The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis [8] and present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier [2] using the type I optimal normal basis.",

keywords = "Elliptic curve, Finite fields, Nonconventional basis, Public-key cryptosystems",

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

note = "Funding Information: This work is supported in part by the Ministry of Information & Communication of Korea (“Support Project of University Information Technology Research Center” supervised by IITA).",

year = "2002",

month = jan,

doi = "10.1109/12.980019",

language = "English",

volume = "51",

pages = "90--92",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "1",

}

TY - JOUR

T1 - A new hardware architecture for operations in GF(2n)

AU - Kim, Chang Han

AU - Oh, Sangho

AU - Lim, Jongin

N1 - Funding Information: This work is supported in part by the Ministry of Information & Communication of Korea (“Support Project of University Information Technology Research Center” supervised by IITA).

PY - 2002/1

Y1 - 2002/1

N2 - The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis [8] and present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier [2] using the type I optimal normal basis.

AB - The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis [8] and present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier [2] using the type I optimal normal basis.

KW - Elliptic curve

KW - Finite fields

KW - Nonconventional basis

KW - Public-key cryptosystems

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

U2 - 10.1109/12.980019

DO - 10.1109/12.980019

M3 - Article

AN - SCOPUS:0036161060

SN - 0018-9340

VL - 51

SP - 90

EP - 92

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 1

ER -