A Scalable Dual Mode Arithmetic Unit for Public Key Cryptosystems

Authors:
Francis Crowe;Alan Daly;William Marnane
Affiliations:
University College Cork, Ireland;University College Cork, Ireland;University College Cork, Ireland
Venue:
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Year:
2005

Citing 0
Cited 6

High-speed hardware implementations of Elliptic Curve Cryptography: A survey

Journal of Systems Architecture: the EUROMICRO Journal
Parallel Memory Architecture for Elliptic Curve Cryptography over $$ \mathbb{G}\mathbb{F}{\left( p \right)} $$ Aimed at Efficient FPGA Implementation

Journal of Signal Processing Systems
A unified architecture for a public key cryptographic coprocessor

Journal of Systems Architecture: the EUROMICRO Journal
Efficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations

Journal of Signal Processing Systems
SPA resistant elliptic curve cryptosystem using addition chains

International Journal of High Performance Systems Architecture
An efficient multimode multiplier supporting AES and fundamental operations of public-key cryptosystems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Elliptic Curve Cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the size of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are 160 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimised version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.