DocumentCode :
2824383
Title :
Research and design of elliptic curve cryptography
Author :
Qu, Yingjie ; Hu, Zhengming
Author_Institution :
Dept. of Comput. Sci. & Technol., Qingdao Univ. of Sci. & Technol., Qingdao, China
Volume :
2
fYear :
2010
fDate :
21-24 May 2010
Abstract :
Binary field is considered to be more suitable for hardware implementation of ECC than large prime number domain GF(p). By analyzing the modular arithmetic in binary field and choosing the suitable algorithm, this paper convert all the modular arithmetic to three types of modular arithmetic: modular addition, modular multiplication and modular square, and then design a arithmetic unit. It finishes the computation and storage of data by using the FSM to control storage unit and the other module. The hardware of implementation of ECC which using this arithmetic unit has small area, small storage unit and fast speed, and it is extremely suitable the system which has limited computation ability and storage space.
Keywords :
cryptography; ECC; binary field; control storage; elliptic curve cryptography; hardware implementation; large prime number domain; modular addition; modular arithmetic; modular multiplication; modular square; Algorithm design and analysis; Digital arithmetic; Elliptic curve cryptography; Elliptic curves; Equations; Hardware; Information technology; Polynomials; Public key cryptography; Space technology; Binary field multiplier; Elliptic Curve Cryptography; Montgomery´s method in projective coordinates; fast modular arithmetic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5821-9
Type :
conf
DOI :
10.1109/ICFCC.2010.5497370
Filename :
5497370
Link To Document :
بازگشت