An efficient scalable and hybrid arithmetic unit for public key cryptographic applications

Su Jung Yu; Moon Gyung Kim; Seok Won Heo; Joo Seok Song; Yong Surk Lee

doi:10.1587/elex.4.461

An efficient scalable and hybrid arithmetic unit for public key cryptographic applications

Su Jung Yu, Moon Gyung Kim, Seok Won Heo, Joo Seok Song, Yong Surk Lee

College of Computing

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

Abstract

In this paper, we propose an efficient scalable and flexible arithmetic unit which executes word-based multiplication and squaring for RSA arithmetic and addition, multiplication and inversion in GF(2^m) for ICUiptic Curve Cryptography (ECC) arithmetic operation. The Scalable Word-based Montgomery Modular arithmetic unit. (SWMM) can process RSA with modified Finely Integrated Operand Scanning (FIOS) Montgomery algorithm. Also, the proposed flexible hybrid Galois Field Arithmetic Unit (GFAU) is beneficial in cost-effectively implementing ECC operation extensions. The proposed processor is synthesized by employing Synopsys Design Analyzer with a Hynix 0.25 standard cell library at the worst case of 2.3 V, 100°C. The synthesis results show that the gate count of processor is below 60,000.

Original language	English
Pages (from-to)	461-466
Number of pages	6
Journal	ieice electronics express
Volume	4
Issue number	14
DOIs	https://doi.org/10.1587/elex.4.461
Publication status	Published - 2007 Jul 25

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Electrical and Electronic Engineering

Access to Document

10.1587/elex.4.461

Cite this

@article{162a6841ba844f6cb0782bf8b3dc2110,

title = "An efficient scalable and hybrid arithmetic unit for public key cryptographic applications",

abstract = "In this paper, we propose an efficient scalable and flexible arithmetic unit which executes word-based multiplication and squaring for RSA arithmetic and addition, multiplication and inversion in GF(2m) for ICUiptic Curve Cryptography (ECC) arithmetic operation. The Scalable Word-based Montgomery Modular arithmetic unit. (SWMM) can process RSA with modified Finely Integrated Operand Scanning (FIOS) Montgomery algorithm. Also, the proposed flexible hybrid Galois Field Arithmetic Unit (GFAU) is beneficial in cost-effectively implementing ECC operation extensions. The proposed processor is synthesized by employing Synopsys Design Analyzer with a Hynix 0.25 standard cell library at the worst case of 2.3 V, 100°C. The synthesis results show that the gate count of processor is below 60,000.",

author = "Yu, {Su Jung} and Kim, {Moon Gyung} and Heo, {Seok Won} and Song, {Joo Seok} and Lee, {Yong Surk}",

year = "2007",

month = jul,

day = "25",

doi = "10.1587/elex.4.461",

language = "English",

volume = "4",

pages = "461--466",

journal = "ieice electronics express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "14",

}

TY - JOUR

T1 - An efficient scalable and hybrid arithmetic unit for public key cryptographic applications

AU - Yu, Su Jung

AU - Kim, Moon Gyung

AU - Heo, Seok Won

AU - Song, Joo Seok

AU - Lee, Yong Surk

PY - 2007/7/25

Y1 - 2007/7/25

N2 - In this paper, we propose an efficient scalable and flexible arithmetic unit which executes word-based multiplication and squaring for RSA arithmetic and addition, multiplication and inversion in GF(2m) for ICUiptic Curve Cryptography (ECC) arithmetic operation. The Scalable Word-based Montgomery Modular arithmetic unit. (SWMM) can process RSA with modified Finely Integrated Operand Scanning (FIOS) Montgomery algorithm. Also, the proposed flexible hybrid Galois Field Arithmetic Unit (GFAU) is beneficial in cost-effectively implementing ECC operation extensions. The proposed processor is synthesized by employing Synopsys Design Analyzer with a Hynix 0.25 standard cell library at the worst case of 2.3 V, 100°C. The synthesis results show that the gate count of processor is below 60,000.

AB - In this paper, we propose an efficient scalable and flexible arithmetic unit which executes word-based multiplication and squaring for RSA arithmetic and addition, multiplication and inversion in GF(2m) for ICUiptic Curve Cryptography (ECC) arithmetic operation. The Scalable Word-based Montgomery Modular arithmetic unit. (SWMM) can process RSA with modified Finely Integrated Operand Scanning (FIOS) Montgomery algorithm. Also, the proposed flexible hybrid Galois Field Arithmetic Unit (GFAU) is beneficial in cost-effectively implementing ECC operation extensions. The proposed processor is synthesized by employing Synopsys Design Analyzer with a Hynix 0.25 standard cell library at the worst case of 2.3 V, 100°C. The synthesis results show that the gate count of processor is below 60,000.

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

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

U2 - 10.1587/elex.4.461

DO - 10.1587/elex.4.461

M3 - Article

AN - SCOPUS:34548412124

SN - 1349-2543

VL - 4

SP - 461

EP - 466

JO - ieice electronics express

JF - ieice electronics express

IS - 14

ER -

An efficient scalable and hybrid arithmetic unit for public key cryptographic applications

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this