An improvement of the Guajardo-Paar method for multiplication on non-supersingular elliptic curves

Author

López, Julio ; Dahab, Ricardo

Author_Institution

IC-UNICAMP, Campinas, Brazil

fYear

1998

fDate

9-14 Nov 1998

Firstpage

91

Lastpage

95

Abstract

Calculation of multiples of elliptic points plays a central role in elliptic curve public key cryptosystems. We present improved formulae for computing repeated doubling points on non supersingular elliptic curves over finite fields of characteristic two. These formulae, in combination with variants of the sliding window method, lead to efficient algorithms for computing a multiple of a point in such elliptic curves. For many practical implementations of the finite field GF(2ⁿ), our formulae can achieve a running time improvement of up to 25% when compared to Guajardo and Paar´s formulae (J. Guajardo and C. Paar, 1997)

Keywords

arithmetic; mathematics computing; public key cryptography; Guajardo-Paar method; elliptic curve public key cryptosystems; elliptic points; finite field; finite fields; multiplication; non supersingular elliptic curves; non-supersingular elliptic curves; repeated doubling points; running time improvement; sliding window method; Arithmetic; Distributed control; Elliptic curve cryptography; Elliptic curves; Equations; Information services; Internet; Public key cryptography; Web sites;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science, 1998. SCCC '98. XVIII International Conference of the Chilean Society of

Conference_Location

Antofogasta

Print_ISBN

0-8186-8616-2

Type

conf

DOI

10.1109/SCCC.1998.730787

Filename

730787