A Resource Efficient Architecture for RSA and Elliptic Curve Cryptosystems
Authors:
- 1 June 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2356-2360
Abstract
This paper presents a resource efficient hardware implementation of both commonly used public key cryptosystems, RSA and elliptic curve cryptosystem (ECC) on the same platform. It can be used in constrained environments, which contain limited amounts of resources and are battery-powered. Furthermore, our implementation is based on a new architecture whose complexity of resources but memory does not grow much with the security level of cryptosystems unlike those based on systolic arrays. Besides, an efficient method, called the decomposition and composition of a finite state machine, is adopted in this paper to design the controllers of the acceleratorKeywords
This publication has 10 references indexed in Scilit:
- Hardware architectures for public key cryptographyIntegration, 2003
- Montgomery modular exponentiation on reconfigurable hardware2003
- ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart Cards2001
- Differential Power Analysis1999
- Chinese Remaindering Based Cryptosystems in the Presence of FaultsJournal of Cryptology, 1999
- Elliptic Curves in Cryptography1999
- Decomposition and factorization of sequential finite state machinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978