VLSI design of an RSA encryption/decryption chip using systolic array based architecture

被引:3
作者
Sun, Chi-Chia [1 ]
Lin, Bor-Shing [2 ]
Jan, Gene Eu [2 ]
Lin, Jheng-Yi [3 ]
机构
[1] Natl Formosa Univ, Dept Elect Engn, Huiwei, Taiwan
[2] Natl Taipei Univ, Dept Elect Engn, New Taipei, Taiwan
[3] Natl Taiwan Ocean Univ, Dept Elect Engn, Keelung, Taiwan
关键词
VLSI; cryptology; RSA; 2048-bit; systolic array; MODULAR MULTIPLICATION;
D O I
10.1080/00207217.2016.1138511
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This article presents the VLSI design of a configurable RSA public key cryptosystem supporting the 512-bit, 1024-bit and 2048-bit based on Montgomery algorithm achieving comparable clock cycles of current relevant works but with smaller die size. We use binary method for the modular exponentiation and adopt Montgomery algorithm for the modular multiplication to simplify computational complexity, which, together with the systolic array concept for electric circuit designs effectively, lower the die size. The main architecture of the chip consists of four functional blocks, namely input/output modules, registers module, arithmetic module and control module. We applied the concept of systolic array to design the RSA encryption/decryption chip by using VHDL hardware language and verified using the TSMC/CIC 0.35m 1P4M technology. The die area of the 2048-bit RSA chip without the DFT is 3.9x3.9mm(2) (4.58x4.58mm(2) with DFT). Its average baud rate can reach 10.84kbps under a 100MHz clock.
引用
收藏
页码:1538 / 1549
页数:12
相关论文
共 9 条
[1]  
[Anonymous], 1969, Seminumerical Algorithms, DOI 10.2307/2283757
[2]   HARDWARE IMPLEMENTATION OF MONTGOMERY MODULAR MULTIPLICATION ALGORITHM [J].
ELDRIDGE, SE ;
WALTER, CD .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (06) :693-699
[3]  
Miyamoto, 2011, IEEE T VERY LARGE SC, V19, P1136, DOI [10.1109/TVLSI.2010.2049037, DOI 10.1109/TVLSI.2010.2049037]
[4]  
MONTGOMERY PL, 1985, MATH COMPUT, V44, P519, DOI 10.1090/S0025-5718-1985-0777282-X
[5]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]
[6]  
Singh A., 1935, HIST HINDU MATH, V1
[7]   STILL FASTER MODULAR MULTIPLICATION [J].
WALTER, CD .
ELECTRONICS LETTERS, 1995, 31 (04) :263-264
[8]   SYSTOLIC MODULAR MULTIPLICATION [J].
WALTER, CD .
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (03) :376-378
[9]   Montgomery exponentiation needs no final subtractions [J].
Walter, CD .
ELECTRONICS LETTERS, 1999, 35 (21) :1831-1832