Open AccessHigh‐throughput multi‐key elliptic curve cryptosystem based on residue number system
Author(s) -
Asif Shahzad,
Hossain Md Selim,
Kong Yinan
Publication year - 2017
Publication title -
iet computers and digital techniques
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.219
H-Index - 46
ISSN - 1751-861X
DOI - 10.1049/iet-cdt.2016.0141
Subject(s) - computer science , elliptic curve cryptography , field programmable gate array , public key cryptography , cryptosystem , cryptography , encryption , key size , key (lock) , residue number system , virtex , throughput , embedded system , parallel computing , arithmetic , computer engineering , computer network , algorithm , mathematics , computer security , operating system , wireless
Public‐key cryptosystems such as elliptic curve cryptography (ECC) and Rivest–Shamir–Adleman (RSA) are widely used for data security in computing systems. ECC provides a high level of security with a much smaller key than RSA, which makes ECC a preferred choice in many applications. This study proposes a multi‐key ECC based on the residue number system. The proposed architecture employees deep pipelining to allow the concurrent encryption of 21 keys. The proposed architectures are implemented on two different field programmable gate array (FPGA) platforms and results are compared with existing ECC architectures. The proposed implementation on Virtex‐7 FPGA achieves a throughput of 1816 kbps at a clock frequency of 73 MHz.