MODULAR MULTIPLICATION HARDWARE ALGORITHMS WITH A REDUNDANT REPRESENTATION AND THEIR APPLICATION TO RSA CRYPTOSYSTEM

被引：49
作者：
TAKAGI, N
YAJIMA, S
机构：
[1] Department of Information Science, Kyoto University, Kyoto
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1992年 / 41卷 / 07期
关键词：
COMPUTER ARITHMETIC; CRYPTOSYSTEM; HARDWARE ALGORITHM; MODULAR MULTIPLICATION; REDUNDANT REPRESENTATION; VLSI;
D O I：
10.1109/12.256444
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A radix-2 and a radix-4 modular multiplication hardware algorithm are proposed. Numbers are represented in a redundant representation and modular additions are performed without carry propagation. Serial-parallel modular multipliers based on them have a regular cellular array structure with a bit slice feature suitable for VLSI implementation. They are efficient especially in applications, such as RSA cryptosystem, where modular multiplications are performed iteratively.
引用
收藏
页码：887 / 891
页数：5
相关论文
共 9 条
[1]  
Avizienis Algirdas, 1961, IRE T ELECT COMPUT, V3, P389
[2]  
Brickell E. F., 1983, Advances in Cryptology, Proceedings of Crypto 82, P51
[3]  
BRICKELL EF, 1990, LECT NOTES COMPUT SC, V435, P368
[4]  
MORITA H, 1990, LECT NOTES COMPUT SC, V435, P387
[5]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]
[6]  
TAKAGI N, 1985, IEEE T COMPUT, V34, P789, DOI 10.1109/TC.1985.1676634
[7]  
TAKAGI N, 1987, THESIS KYOTO U
[8]  
TAKAGI N, 1986, IECEJ COMP8614 REP T
[9]  
YASUURA H, 1987, PERSPECT COMPUT, V15, P145
1