DocumentCode :
3332320
Title :
The design of high performance elliptic curve cryptographic
Author :
Hong, Jin-Hua ; Wu, Wei-Chung
Author_Institution :
Dept. of Electr. Eng., Nat. Univ. of Kaohsiung, Kaohsiung, Taiwan
fYear :
2009
fDate :
2-5 Aug. 2009
Firstpage :
527
Lastpage :
530
Abstract :
In this paper, we propose an elliptic curve cryptographic (ECC) architecture for a lower hardware resource. In our work, the different paths of encryption and decryption could be chosen, and the elliptic curve (EC) is based on GF (2163). The EC scalar multiplication is a main operation module that includes add, Montgomery multiplier and inverse in ECC architecture. All modules are organized in a hierarchical structure according to their complexity. In the hardware implementations using a 0.18 mum TSMC cell library, a 69 K gate count is possessed, and the maximum speed is 181 MHz. The EC multiplication time is from 1.26 ms to 2.52 ms. The private key k is a 163-bit random number. If the private key k is chosen to be a small one, the EC multiplication time would be faster.
Keywords :
Galois fields; public key cryptography; EC scalar multiplication; GF (2163); Montgomery multiplier; TSMC cell library; decryption; encryption; high performance elliptic curve cryptographic architecture; random number; time 1.26 ms to 2.52 ms; Data security; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; Hardware; Libraries; Polynomials; Public key cryptography; Smart cards; Elliptic Curve Cryptosystems; Montgomery Inverse; Montgomery Modular Multiplication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2009. MWSCAS '09. 52nd IEEE International Midwest Symposium on
Conference_Location :
Cancun
ISSN :
1548-3746
Print_ISBN :
978-1-4244-4479-3
Electronic_ISBN :
1548-3746
Type :
conf
DOI :
10.1109/MWSCAS.2009.5236038
Filename :
5236038
Link To Document :
بازگشت