DocumentCode
1007377
Title
Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem
Author
Takagi, Naofumi ; Yajima, Shuzo
Author_Institution
Dept. of Inf. Sci., Kyoto Univ., Japan
Volume
41
Issue
7
fYear
1992
fDate
7/1/1992 12:00:00 AM
Firstpage
887
Lastpage
891
Abstract
Radix-2 and radix-4 modular multiplication hardware algorithms 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 an RSA cryptosystem, where modular multiplications are performed iteratively
Keywords
VLSI; cryptography; digital arithmetic; RSA cryptosystem; VLSI implementation; bit slice feature; cellular array structure; modular multiplication hardware algorithms; multipliers; redundant representation; Algorithm design and analysis; Application software; CMOS technology; Circuits; Clocks; Digital arithmetic; Hardware; Iterative algorithms; Public key cryptography; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.256444
Filename
256444
Link To Document