New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Soonhak Kwon; Taekyoung Kwon; Young Ho Park

doi:10.1093/ietfec/e91-a.1.236

New hardware architecture for multiplication over GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Soonhak Kwon, Taekyoung Kwon, Young Ho Park

Graduate School of Information

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

Abstract

We propose a new linear array for multiplication in GF(2^m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2^m),m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography.

Original language	English
Pages (from-to)	236-243
Number of pages	8
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E91-A
Issue number	1
DOIs	https://doi.org/10.1093/ietfec/e91-a.1.236
Publication status	Published - 2008

All Science Journal Classification (ASJC) codes

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1093/ietfec/e91-a.1.236

Cite this

@article{31de2709fd8640da86fa60236b9d6cdc,

title = "New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography",

abstract = "We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m),m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography.",

author = "Soonhak Kwon and Taekyoung Kwon and Park, {Young Ho}",

year = "2008",

doi = "10.1093/ietfec/e91-a.1.236",

language = "English",

volume = "E91-A",

pages = "236--243",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "1",

}

New hardware architecture for multiplication over GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. / Kwon, Soonhak; Kwon, Taekyoung; Park, Young Ho.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 1, 2008, p. 236-243.

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

TY - JOUR

T1 - New hardware architecture for multiplication over GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

AU - Kwon, Soonhak

AU - Kwon, Taekyoung

AU - Park, Young Ho

PY - 2008

Y1 - 2008

N2 - We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m),m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography.

AB - We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m),m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography.

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

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

U2 - 10.1093/ietfec/e91-a.1.236

DO - 10.1093/ietfec/e91-a.1.236

M3 - Article

AN - SCOPUS:77951293210

SN - 0916-8508

VL - E91-A

SP - 236

EP - 243

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 1

ER -

New hardware architecture for multiplication over GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this