The design of high performance elliptic curve cryptographic
Authors:
- 1 August 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15483746,p. 527-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
This publication has 5 references indexed in Scilit:
- A Resource Efficient Architecture for RSA and Elliptic Curve Cryptosystems2006
- High-Speed Design of Montgomery Inverse Algorithm over GF(2m)IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
- An FPGA implementation of an elliptic curve processor GF(2 m )2004
- Architectures for unified field inversion with applications in elliptic curve cryptography2003
- A scalable dual-field elliptic curve cryptographic processorIEEE Transactions on Computers, 2003