Title :
GF(2191) Elliptic Curve Processor using Montgomery Ladder and High Speed Finite Field Arithmetic Unit
Author :
Chang-Soo Ha ; Kim, Joo-Hong ; Choi, Byeong-Yoon ; Lee, Jong-Hyoung ; Kim, Ho-Won
Author_Institution :
Dept. of Comput. Eng., Dong-Eui Univ., Busan
Abstract :
This paper describes hardware implementation of GF(2191) elliptic curve cryptographic(ECC) coprocessor. It supports 6 operations such as scalar multiplication(kP), Menezes-Vanstone(MV) elliptic curve cipher/decipher, point addition(P+Q), point doubling(2P), and finite-field multiplication/division. The ECC processor adopts the Montgomery scalar multiplication scheme in which main loop can be executed using only x-coordinate. It also takes advantage of concurrent operations among arithmetic units, such as GF_ALU, GF_MUL, and GF_DIV to achieve high cipher rate. The processor has about 68,000 gates using 0.35 um CMOS technology, and its worst case delay time is about 7.8-ns. It can be efficiently applied to various elliptic curve cryptographic applications due to high cipher rate (about 647 kbps) and the possible 6 operations.
Keywords :
CMOS integrated circuits; cryptography; CMOS technology; Menezes-Vanstone elliptic curve; Montgomery ladder; cipher/decipher; elliptic curve cryptographic coprocessor; elliptic curve processor; finite-field multiplication/division; high speed finite field arithmetic unit; point addition; point doubling; scalar multiplication; Algorithm design and analysis; CMOS technology; Coprocessors; Digital arithmetic; Elliptic curve cryptography; Elliptic curves; Galois fields; Hardware; Information security; Performance analysis; Elliptic Curve Cryptosystem; Montgomery Ladder; System-on-Chip;
Conference_Titel :
TENCON 2005 2005 IEEE Region 10
Conference_Location :
Melbourne, Qld.
Print_ISBN :
0-7803-9311-2
Electronic_ISBN :
0-7803-9312-0
DOI :
10.1109/TENCON.2005.301250