65-nm CMOS low-energy RNS modular multiplier for elliptic-curve cryptography

被引:5
作者
Asif, Shahzad [1 ]
Andersson, Oskar [2 ]
Rodrigues, Joachim [2 ]
Kong, Yinan [1 ]
机构
[1] Macquarie Univ, Dept Engn, Sydney, NSW, Australia
[2] Lund Univ, Dept Elect & Informat Technol, Lund, Sweden
关键词
public key cryptography; residue number systems; multiplying circuits; CMOS logic circuits; 65-nm CMOS low-energy RNS modular multiplier; elliptic-curve cryptography algorithm; modular multiplication; Rivest-Shamir-Adleman cryptography algorithm; elliptic curve point multiplication; modular exponentiation; Chinese remainder theorem; residue number system; 40-channel RNS moduli-set; short-channel width; ASIC; energy dissipation; low-voltage ECC; energy-efficient ECC; MONTGOMERY EXPONENTIATION; PARALLEL; CRYPTOSYSTEMS; ALGORITHM; RSA;
D O I
10.1049/iet-cdt.2017.0017
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Modular multiplication (MM) is the main operation in cryptography algorithms such as elliptic-curve cryptography (ECC) and Rivest-Shamir-Adleman, where repeated MM is used to perform elliptic curve point multiplication and modular exponentiation, respectively. The algorithm for the proposed architecture is derived from the Chinese remainder theorem and performs MM completely within a residue number system (RNS). Moreover, a 40-channel RNS moduli-set is proposed for this architecture to benefit from the short-channel width of the RNS moduli-set. The throughput of the architecture is enhanced by pipelining and pre-computations. The proposed architecture is fabricated as an ASIC using 65-nm CMOS technology. The measurement results are obtained for energy dissipation at different voltage levels from 0.43 to 1.25V. The maximum throughput of the proposed design is 1037Mbps while operating at a frequency of 162MHz with an energy dissipation of 48nJ. The proposed architecture enables the construction of low-voltage and energy-efficient ECCs.
引用
收藏
页码:62 / 67
页数:6
相关论文
共 28 条
[1]  
Aichholzer O., 1993, P EPP, P41
[2]  
[Anonymous], THESIS
[3]   RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures [J].
Antao, Samuel ;
Bajard, Jean-Claude ;
Sousa, Leonel .
COMPUTER JOURNAL, 2012, 55 (05) :629-647
[4]   Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System [J].
Asif, Shahzad ;
Kong, Yinan .
CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2017, 36 (03) :1027-1051
[5]   A full RNS implementation of RSA [J].
Bajard, JC ;
Imbert, L .
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (06) :769-774
[6]   An RNS Montgomery modular multiplication algorithm [J].
Bajard, JC ;
Didier, LS ;
Kornerup, P .
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (07) :766-776
[7]   Some improvement on RNS montgomery modular multiplication [J].
Bajard, JC ;
Didier, LS ;
Kornerup, P ;
Rico, F .
ADVANCED SIGNAL PROCESSING ALGORITHMS, ARCHITECTURES, AND IMPLEMENTATIONS X, 2000, 4116 :214-225
[8]   Modular multiplication and base extensions in residue number systems [J].
Bajard, JC ;
Didier, LS ;
Kornerup, P .
ARITH-15 2001: 15TH SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2001, :59-65
[9]  
BARRETT P, 1987, LECT NOTES COMPUT SC, V263, P311
[10]  
DHEM JF, 1998, THESIS