Left-to-right binary signed-digit recoding for elliptic curve cryptography

Author

Katti, Rajendra ; Ruan, Xiaoyu

Author_Institution

Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND, USA

Volume

2

fYear

2004

fDate

23-26 May 2004

Abstract

In this paper we present a new left-to-right (i.e., from the most significant bit to the least significant bit) algorithm to compute the binary signed-digit representations of two integers g and h such that their joint weight is optimal. This method has lower complexity compared to the best known method JSF (Joint Sparse Form) algorithm. This method can be easily extended to the case of finding the signed-digit representation of more than two integers. In [1] Solinas left this as an open problem. Such an algorithm is useful in simplifying the circuits for the implementation of elliptic curve cryptosystems (ECC).

Keywords

binary codes; cryptography; digital arithmetic; encoding; binary recoding; elliptic curve cryptography; elliptic curve cryptosystems; joint sparse form; joint weight; least significant bit; left-to-right algorithm; most significant bit; optimal signed digit representation; Circuits; Digital signatures; Elliptic curve cryptography; Elliptic curves; Hardware; Neodymium; Security;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on

Print_ISBN

0-7803-8251-X

Type

conf

DOI

10.1109/ISCAS.2004.1329284

Filename

1329284