A Fully RNS based ECC Processor

被引:16
作者
Asif, Shahzad [1 ]
Hossain, Md Selim [1 ]
Kong, Yinan [1 ]
Abdul, Wadood [2 ]
机构
[1] Macquarie Univ, Dept Engn, Sydney, NSW 2109, Australia
[2] King Saud Univ, Coll Comp & Informat Sci, Dept Comp Engn, Riyadh, Saudi Arabia
关键词
Residue number system (RNS); Modular multiplier; Montgomery multiplier; Elliptic curve cryptography (ECC); Elliptic curve point multiplication (ECPM); ECC processor (ECP); Field programmable gate array (FPGA); CURVE CRYPTOGRAPHIC PROCESSOR; SCALAR MULTIPLICATIONS; HARDWARE; RESISTANT; GF(P);
D O I
10.1016/j.vlsi.2017.11.010
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This work proposes a residue number system (RNS) based hardware architecture of an elliptic curve cryptography (ECC) processor over prime field. The processor computes point multiplication in Jacobian coordinates by a combined architecture of point doubling and point addition. An optimized modular reduction architecture is also presented that achieves low area by dividing the RNS moduli in small groups and processes the groups one by one. The proposed ECC processor is generic and supports any random curve over F(p)256. The implementation on Virtex-7 and Virtex-6 FPGAs shows comparable performance to the state-of-the-art binary and RNS based ECC processors.
引用
收藏
页码:138 / 149
页数:12
相关论文
共 39 条
[1]   Fast and Flexible Hardware Support for ECC Over Multiple Standard Prime Fields [J].
Alrimeih, Hamad ;
Rakhmatov, Daler .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2014, 22 (12) :2661-2674
[2]   Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields [J].
Ananyi, Kendall ;
Alrimeih, Hamad ;
Rakhmatov, Daler .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009, 17 (08) :1099-1112
[3]  
[Anonymous], 1959, P W JOINT COMP C SAN
[4]   High-throughput multi-key elliptic curve cryptosystem based on residue number system [J].
Asif, Shahzad ;
Hossain, Md Selim ;
Kong, Yinan .
IET COMPUTERS AND DIGITAL TECHNIQUES, 2017, 11 (05) :165-172
[5]   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
[6]   Parallel and High-Speed Computations of Elliptic Curve Cryptography Using Hybrid-Double Multipliers [J].
Azarderakhsh, Reza ;
Reyhani-Masoleh, Arash .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (06) :1668-1677
[7]  
Bajard J. C., 2004, P CHES 2004, P62
[8]  
Bajard J. C., 2015, 2 INT C PERS TECHN, P139
[9]  
Baldwin B, 2012, J CRYPTOGR ENG, V2, P221, DOI 10.1007/s13389-012-0042-2
[10]   Modulo M multiplication-addition:: algorithms and FPGA implementation [J].
Beuchat, J ;
Muller, JM .
ELECTRONICS LETTERS, 2004, 40 (11) :654-655