A Fast Hybrid Arithmetic Unit for Elliptic Curve Cryptosystem in Galois Fields with Prime and Composite Exponents

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

doi:10.1587/elex.1.13

LETTER

A Fast Hybrid Arithmetic Unit for Elliptic Curve Cryptosystem in Galois Fields with Prime and Composite Exponents

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

Author information

Keywords: finite field arithmetic, elliptic curves, hybrid GFAU, multiplication, inversion, cryptography

JOURNAL FREE ACCESS

2004 Volume 1 Issue 1 Pages 13-18

DOI https://doi.org/10.1587/elex.1.13

Details

Abstract

In this paper, we propose the efficient flexible hybrid arithmetic unit for elliptic curve cryptographic applications which executes addition, multiplication and inversion in GF (2^m). The proposed flexible hybrid GFAU is beneficial in cost-effectively implementing microprocessors' elliptic curve public-key extensions. It targets applications for smart cards whose gate count is below 20,000.

Corresponding author

Register with J-STAGE for free!