Title
An Efficient Scalable And Hybrid Arithmetic Unit For Public Key Cryptographic Applications
Abstract
In this paper, we propose an effcient 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 Elliptic 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 degrees C. The synthesis results show that the gate count of processor is below 60,000.
Year
DOI
Venue
2007
10.1587/elex.4.461
IEICE ELECTRONICS EXPRESS
Keywords
Field
DocType
RSA, ECC, public key cryptographic processor
Gate count,Modular arithmetic,Computer science,Arbitrary-precision arithmetic,Parallel computing,Operand,Arithmetic,Kochanski multiplication,Multiplication,Saturation arithmetic,Elliptic curve cryptography
Journal
Volume
Issue
ISSN
4
14
1349-2543
Citations 
PageRank 
References 
0
0.34
3
Authors
5
Name
Order
Citations
PageRank
SuJung Yu131.54
MoonGyung Kim200.34
SeokWon Heo300.34
JooSeok Song430658.82
Yong-surk Lee5177.35