Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Type: Conference paper
Title: Elliptic curve digital signature algorithm over GF(p) on a residue number system enabled microprocessor
Author: Lim, Z.
Phillips, B.
Liebelt, M.
Citation: Proceedings of TENCON 2009: pp.1-6
Publisher: IEEE
Publisher Place: CDROM
Issue Date: 2009
Series/Report no.: TENCON IEEE Region 10 Conference Proceedings
ISBN: 9781424445479
ISSN: 2159-3442
Conference Name: TENCON (2009 : Singapore)
Statement of
Zhining Lim, Braden J. Phillips, and Michael Liebelt
Abstract: 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.
Keywords: Elliptic curve digital signature algorithm implementation; residue number system; instruction set extension; smart card processor; Xtensa LX2.1 microprocessor
RMID: 0020095260
DOI: 10.1109/TENCON.2009.5396175
Appears in Collections:Environment Institute publications
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.