DocumentCode :
3258708
Title :
Elliptic curve digital signature algorithm over GF(p) on a residue number system enabled microprocessor
Author :
Lim, Zhining ; Phillips, Braden J. ; Liebelt, Michael
Author_Institution :
Sch. of Electr. & Electron. Eng., Univ. of Adelaide, Adelaide, SA, Australia
fYear :
2009
fDate :
23-26 Jan. 2009
Firstpage :
1
Lastpage :
6
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 :
digital signatures; microprocessor chips; public key cryptography; Tensilica Xtensa LX2.1 microprocessor; elliptic curve cryptography; elliptic curve digital signature algorithm; residue number system enabled microprocessor; sequential microprocessor; smart cards; Arithmetic; Australia; Clocks; Digital signatures; Elliptic curve cryptography; Elliptic curves; Hardware; Microprocessors; Signal processing algorithms; Smart cards; Elliptic curve digital signature algorithm implementation; Xtensa LX2.1 microprocessor; instruction set extension; residue number system; smart card processor;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 2009 - 2009 IEEE Region 10 Conference
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-4546-2
Electronic_ISBN :
978-1-4244-4547-9
Type :
conf
DOI :
10.1109/TENCON.2009.5396175
Filename :
5396175
Link To Document :
بازگشت