Elliptic curve digital signature algorithm over GF(p) on a residue number system enabled microprocessor

We describe a residue number system (RNS) implementation of the 192-bit elliptic curve digital signature algorithm over GF(p). It uses a Tensilica Xtensa LX2.1 microprocessor core with hardware extensions to improve the performance of RNS operations. The low power and small area of the enhanced Xten...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhining Lim, Phillips, B.J., Liebelt, M.
Format: Conference Proceeding
Language:English
Subjects:
Arithmetic
Australia
Clocks
Digital signatures
Elliptic curve cryptography
Elliptic curve digital signature algorithm implementation
Elliptic curves
Hardware
instruction set extension
Microprocessors
residue number system
Signal processing algorithms
smart card processor
Smart cards
Xtensa LX2.1 microprocessor
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe a residue number system (RNS) implementation of the 192-bit elliptic curve digital signature algorithm over GF(p). It uses a Tensilica Xtensa LX2.1 microprocessor core with hardware extensions to improve the performance of RNS operations. The low power and small area of the enhanced Xtensa LX2.1 core make it suitable for smart cards. This implementation is the first to use the RNS for elliptic curve cryptography on a sequential microprocessor. The RNS-enabled microprocessor performs a 192-bit point multiplication in approximately 2 million clock cycles, a performance that compares well to other minimally enhanced elliptic curve cryptography implementations.
ISSN:2159-3442
2159-3450
DOI:10.1109/TENCON.2009.5396175