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

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

doi:10.1109/iscas.2006.1693348

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

D.M Schinianakis, T Stouraitis + Show 2 more

https://doi.org/10.1109/iscas.2006.1693348

Copy DOI

Publication Date: May 21, 2006

Citations: 8

Affiliation: University of Patras

#Elliptic Curve Point Multiplier #Residue Number System + Show 8 more

Abstract
Full-Text
Similar Papers

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.