Efficient scalar multiplication based on window algorithm with 2´s complement applied for elliptic curve cryptosystems

Author

Mohamed, M Abd-Eldayem ; Ehab, T Alnfrawy ; Aly, A.F.

Author_Institution

Dept. of Comput. Eng., King Saud Univ., Riyadh, Saudi Arabia

fYear

2010

fDate

Nov. 29 2010-Dec. 1 2010

Firstpage

342

Lastpage

347

Abstract

In this paper we propose an efficient and secure elliptic curve scalar multiplication algorithm over odd prime fields. For this purpose, we propose an explicit algorithm for short addition-subtraction chain method which utilizes a 2´s Complement with window method. We term it as W2CASC. Our proposed scalar multiplication algorithm based on W2CASC algorithm has preceded by 12.7% to 28% 160 bit multiplier over similar techniques. Hence scalar multiplication utilizing W2CASC algorithm shows significance in application to elliptic curve cryptosystems. Also our algorithm has preceded by 26% to 28% in context of Elliptic Curve Cryptosystems (ECC).

Keywords

linear algebra; public key cryptography; 2 complement; W2CASC algorithm; elliptic curve cryptosystem; odd prime field; scalar multiplication; short addition-subtraction chain method; window algorithm; window method; addition-subtraction chain; elliptic curve cryptosystems; scalar multiplication; window method;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on

Conference_Location

Cairo

Print_ISBN

978-1-4244-8134-7

Type

conf

DOI

10.1109/ISDA.2010.5687240

Filename

5687240