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

Soonhak Kwon, Taekyoung Kwon, Young Ho Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers
PublisherSpringer Verlag
Pages335-351
Number of pages17
ISBN (Print)3540333541, 9783540333548
DOIs
Publication statusPublished - 2006 Jan 1
Event8th International Conference on Information Security and Cryptology, ICISC 2005 - Seoul, Korea, Republic of
Duration: 2005 Dec 12005 Dec 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3935 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Information Security and Cryptology, ICISC 2005
Country/TerritoryKorea, Republic of
CitySeoul
Period05/12/105/12/2

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'New architecture for multiplication in 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