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 条
[21]  
MONTGOMERY PL, 1985, MATH COMPUT, V44, P519, DOI 10.1090/S0025-5718-1985-0777282-X
[22]   A Parallel and Uniform k-Partition Method for Montgomery Multiplication [J].
Neto, Joao Carlos ;
Tenca, Alexandre Ferreira ;
Ruggiero, Wilson Vicente .
IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (09) :2122-2133
[23]  
Nozaki H., 2001, Cryptographic Hardware and Embedded Systems - CHES 2001. Third International Workshop. Proceedings (Lecture Notes in Computer Science Vol.2162), P364
[24]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017
[25]  
Schinianakis D, 2014, IEEE INT SYMP CIRC S, P2229, DOI 10.1109/ISCAS.2014.6865613
[26]   An RNS Implementation of an Fp Elliptic Curve Point Multiplier [J].
Schinianakis, Dimitrios A. ;
Fournaris, Apostolos P. ;
Michail, Harris E. ;
Kakarountas, Athanasios P. ;
Stouraitis, Thanos .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2009, 56 (06) :1202-1213
[27]  
Szabo N. S., 1967, Residue Arithmetic and Its Applications to Computer Technology
[28]  
Tong-Jie Y., 2010, 2010 INT C COMP APPL, V10, pV10