DocumentCode
795543
Title
Hybrid method for modular exponentiation with precomputation
Author
Chen, C.-Y. ; Chang, C.-C. ; Yang, W.P.
Author_Institution
Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
Volume
32
Issue
6
fYear
1996
fDate
3/14/1996 12:00:00 AM
Firstpage
540
Lastpage
541
Abstract
The authors present a new hybrid method for performing modular exponentiation using a hybrid ternary-quinary number system. A recent result concerning performing modular exponentiation with precomputation was presented by Dimitrov and Cooklev (see IEICE Trans. Fundam., vol. E78-A, no. 1, p. 82-7, 1995): their average number of modular multiplications is 0.3381n, where n is the length of the modulus, while the authors´ proposed method only needs 0.3246n modular multiplications. Furthermore, compared to Dimitrov and Cooklev´s approach, the authors´ method reduces the amount of storage by 56.8% if the modulus is a 512 bit number
Keywords
cryptography; digital arithmetic; hybrid method; modular exponentiation; modular multiplications; precomputation; ternary-quinary number system;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19960345
Filename
490459
Link To Document