A new approach to elliptic curve cryptography: An RNS architecture

被引：25
作者：
Schinianakis, D. M. [1 ]
Kakarountas, A. P. [1 ]
Stouraitis, T. [1 ]
机构：
[1] Univ Patras, Dept Elect & Comp Engn, Patras, Greece
来源：
CIRCUITS AND SYSTEMS FOR SIGNAL PROCESSING , INFORMATION AND COMMUNICATION TECHNOLOGIES, AND POWER SOURCES AND SYSTEMS, VOL 1 AND 2, PROCEEDINGS | 2006年
关键词：
D O I：
10.1109/MELCON.2006.1653327
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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.
引用
收藏
页码：1241 / 1245
页数：5
相关论文
共 12 条
[1]  
AICHHOLZER IO, WORKSH EC PAR PROC E, P40
[2]  
[Anonymous], ELLIPTIC CURVES CRYP
[3]   A full RNS implementation of RSA [J].
Bajard, JC ;
Imbert, L .
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (06) :769-774
[4]  
BEUCHAT JL, IEE ELECT LETT, V40
[5]  
CARDARILLI GC, 2003, 2003 IEEE AER C P, V3
[6]  
KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
[7]  
MILLER V, 1986, LNCS, V218, P47
[8]  
ORLANDO G, 2001, P WORKSH CRYPT HARDW
[9]  
ORS SB, P APPL SPEC SYST ARC
[10]  
Parhami B., 2000, COMPUTER ARITHMETIC
12