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

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'New hardware architecture for multiplication over GF(2<sup>m</sup>) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography'. Together they form a unique fingerprint.

  • Cite this