DocumentCode :
453651
Title :
An efficient architecture for computing division over GF(/sup 2/m) in elliptic curve cryptography
Author :
Zhou, Jian-Yang ; Jiang, Xiao-Gang ; Chen, Hui-Huang
Author_Institution :
Dept. of Electron. Eng., Xiamen Univ.
Volume :
1
fYear :
2005
fDate :
24-0 Oct. 2005
Firstpage :
321
Lastpage :
325
Abstract :
In the computing system, division is normally programmed as an multiplication operation following with a multiplicative inversion process. It is the most time consuming operation in the computing of elliptic curve cryptography (ECC) for portable applications. This paper introduces a new architecture for hardware implementation of computing division based on the binary extended Euclidean algorithm. With the new architecture, ECC can be implemented with low power consumption and more computing efficiency for application in real-time system. In order to show the advantages, we also detail on the modified algorithm of our new architecture and compare the synthesis results of hardware implementations
Keywords :
Galois fields; cryptography; digital arithmetic; real-time systems; Galois field; binary extended Euclidean algorithm; division operation; elliptic curve cryptography; low power consumption; multiplication operation; multiplicative inversion process; real-time system; Algorithm design and analysis; Application software; Computer architecture; Data security; Elliptic curve cryptography; Hardware; Information security; Polynomials; Public key cryptography; Sun;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ASIC, 2005. ASICON 2005. 6th International Conference On
Conference_Location :
Shanghai
Print_ISBN :
0-7803-9210-8
Type :
conf
DOI :
10.1109/ICASIC.2005.1611303
Filename :
1611303
Link To Document :
بازگشت