Efficient RNS Implementation of Elliptic Curve Point Multiplication Over GF(p)

被引：58

作者：

Esmaeildoust, Mohammad ^{[1
]}

Schinianakis, Dimitrios ^{[2
]}

Javashi, Hamid ^{[3
]}

Stouraitis, Thanos ^{[2
]}

Navi, Keivan ^{[1
]}

机构：

[1] Shahid Beheshti Univ, Fac Elect & Comp Engn, Tehran 1983963113, Iran

[2] Univ Patras, Dept Elect & Comp Engn, Patras 13231, Greece

[3] Shahid Beheshti Univ, Microelect Lab, Tehran 1983963113, Iran

来源：

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS | 2013年 / 21卷 / 08期

关键词：

Elliptic curve cryptography (ECC); Montgomery multiplication; residue arithmetic; residue number system (RNS); ARCHITECTURE; PROCESSOR;

D O I：

10.1109/TVLSI.2012.2210916

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Elliptic curve point multiplication (ECPM) is one of the most critical operations in elliptic curve cryptography. In this brief, a new hardware architecture for ECPM over GF(p) is presented, based on the residue number system (RNS). The proposed architecture encompasses RNS bases with various word-lengths in order to efficiently implement RNS Montgomery multiplication. Two architectures with four and six pipeline stages are presented, targeted on area-efficient and fast RNS Montgomery multiplication designs, respectively. The fast version of the proposed ECPM architecture achieves higher speeds and the area-efficient version achieves better area-delay tradeoffs compared to state-of-the-art implementations.

引用

页码：1545 / 1549

页数：5

共 15 条

[1]

Bajard J, 1998, IEEE T COMPUT, V47, P167

[2] Selected RNS Bases for Modular Multiplication [J].