Parallel scalar multiplication for elliptic curve cryptosystems

Author

Ansari, Bijan ; Wu, Huapeng

Author_Institution

Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada

Volume

1

fYear

2005

Firstpage

71

Abstract

A parallel elliptic curve scalar multiplication algorithm is proposed. The algorithm works at its highest efficiency when a dual-processor hardware system is utilized. The new method has an average computation time of n/3 times of that of one elliptic curve addition (ECADD) on an n-bit scalar. The saving is n elliptic curve doublings (ECDBLs) compared to standard (single processor) methods. When the ratio of the execution time of a point addition to that of a point doubling is 3, the proposed method is 90% faster than the standard method.

Keywords

cryptography; digital arithmetic; multiprocessing systems; parallel processing; dual-processor hardware system; elliptic curve addition; elliptic curve cryptosystems; elliptic curve doublings; parallel elliptic curve scalar multiplication algorithm; parallel scalar multiplication; point addition; point doubling; Bandwidth; Communication system security; Digital signatures; Elliptic curve cryptography; Elliptic curves; Hardware; Public key cryptography; Research and development; Smart cards; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on

Print_ISBN

0-7803-9015-6

Type

conf

DOI

10.1109/ICCCAS.2005.1493364

Filename

1493364