An RNS architecture of an F/sub p/ elliptic curve point multiplier

Author

Schinianakis, D.M. ; Fournaris, A.P. ; Kakarountas, A.P. ; Stouraitis, T.

Author_Institution

Dept. of Electr. & Comput. Eng., Patras Univ.

fYear

2006

fDate

21-24 May 2006

Abstract

An elliptic curve point multiplier (ECPM) is the main part of all elliptic curve cryptography (ECC) systems and its performance is decisive for the performance of the overall cryptosystem. A VLSI residue number system (RNS) architecture of an ECPM is presented in this paper. In the proposed approach, the necessary mathematical conditions that need to be satisfied, in order to replace typical finite field circuits with RNS ones, are investigated. It is shown that such an application is feasible and that it leads to a significant improvement in the execution time of a scalar point multiplication

Keywords

VLSI; cryptography; integrated circuit design; logic design; multiplying circuits; residue number systems; RNS architecture; VLSI residue number system architecture; elliptic curve cryptography systems; elliptic curve point multiplier; finite field circuits; scalar point multiplication; Arithmetic; Computer architecture; Costs; Dynamic range; Elliptic curve cryptography; Elliptic curves; Filter bank; Galois fields; Hardware; Public key cryptography;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on

Conference_Location

Island of Kos

Print_ISBN

0-7803-9389-9

Type

conf

DOI

10.1109/ISCAS.2006.1693348

Filename

1693348