DocumentCode
2874247
Title
SPA Resistant Algorithms for Elliptic Curve Cryptography over GF(2m)
Author
Tian, Min ; Wang, Jizhi ; Xu, Shujiang ; Wang, Yinglong
Author_Institution
Comput. Network Key Lab., Shandong Comput. Sci. Center, Jinan, China
fYear
2009
fDate
19-20 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
Scalar multiplication is the kernel and most time-consuming operation in elliptic curve cryptosystems. In this paper, efficient and secure scalar multiplication algorithms are proposed over binary field, where the scalar multiplication can be designed and implemented rapidly without arithmetic coprocessor. By using innovative side channel atomicity in point operation formulae, these proposed algorithms can be protected against simple power analysis, and thereby achieve higher security without loss of overall performance.
Keywords
linear algebra; public key cryptography; SPA resistant algorithms; elliptic curve cryptography; innovative side channel; scalar multiplication; Algorithm design and analysis; Arithmetic; Cryptographic protocols; Elliptic curve cryptography; Elliptic curves; Energy consumption; Galois fields; Personal digital assistants; Pervasive computing; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4994-1
Type
conf
DOI
10.1109/ICIECS.2009.5366853
Filename
5366853
Link To Document