DocumentCode
1393471
Title
Space/time trade-offs for higher radix modular multiplication using repeated addition
Author
Walter, Colin D.
Author_Institution
Comput. Dept., Univ. of Manchester Inst. of Sci. & Technol., UK
Volume
46
Issue
2
fYear
1997
fDate
2/1/1997 12:00:00 AM
Firstpage
139
Lastpage
141
Abstract
The value of using a higher radix for modular multiplication in the context of RSA is investigated. The main conclusion is that for algorithms which perform the multiplication via repeated addition, there is, broadly speaking, a direct trade-off between space and time provided by change of radix. Thus chip area utilized is roughly proportional to speed. However, initially, as the radix is increased from 2, there is a short-lived increase in speed greater than the extra area used
Keywords
cryptography; digital arithmetic; redundant number systems; RSA; chip area; higher radix modular multiplication; repeated addition; space/time trade-offs; Adders; Algorithm design and analysis; Arithmetic; Circuits; Clocks; Costs; Cryptography; Discrete Fourier transforms; Hardware; Heart;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.565588
Filename
565588
Link To Document