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

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)236-243
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number1
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Normal Basis
Polynomial Basis
Linear Array
Hardware Architecture
Cryptography
Elliptic Curves
Time Complexity
Multiplier
Multiplication
Polynomials
Binary
Hardware
Architecture

All Science Journal Classification (ASJC) codes

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

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",
month = "1",
day = "1",
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",

}

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/1/1

Y1 - 2008/1/1

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

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

SN - 0916-8508

IS - 1

ER -