Concurrent realization of the multiply-by-7 Elliptic Curve Scalar Multiplication algorithm

Author

NaseimoDaikpor, Michael ; Adegbenro, Oluwole

Author_Institution

Dept. of Electr. & Electron. Eng., Univ. of Lagos, Lagos, Nigeria

fYear

2011

fDate

11-14 Dec. 2011

Firstpage

797

Lastpage

804

Abstract

This paper investigates the multiply-by-7 Elliptic Curve (EC) point P Scalar Multiplication algorithm for reduced computational complexity and enhanced inherent parallel property based on the Area-Time (AT²) metric. The findings were compared with those obtained when the algorithm was again realized on the Jacobian projective coordinate and the Non-Adjacent Form (NAF). The investigation revealed 27% and 8% computational complexity reductions over the Jacobian and NAF realizations. The algorithm also presents the best AT² value.

Keywords

Jacobian matrices; computational complexity; public key cryptography; Jacobian projective coordinate; area-time metric; computational complexity; concurrent realization; inherent parallel property; multiply-by-7 elliptic curve scalar multiplication algorithm; nonadjacent form; Computational complexity; Elliptic curves; Equations; Galois fields; Generators; Jacobian matrices; Mathematical model; computational complexity; concurrent processing; data flow graph; scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Technology and Secured Transactions (ICITST), 2011 International Conference for

Conference_Location

Abu Dhabi

Print_ISBN

978-1-4577-0884-8

Type

conf

Filename

6148440