DocumentCode
1012499
Title
Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih
Author
Wu, Tzong-Chen ; Chang, Yuh-Shihng
Author_Institution
Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
Volume
31
Issue
20
fYear
1995
fDate
9/28/1995 12:00:00 AM
Firstpage
1738
Lastpage
1739
Abstract
Yen and Laih (1993) proposed an algorithm for efficient computation of the common-multiplicand multiplications problem {X×Yi|i=1, 2, ..., t; t⩾2}, which is very useful for public key cryptographic exponentiation computation. By using a k-times folding technique, the authors present an improved generalisation of the algorithm of Yen and Laih and show that the improvement needs fewer multiplications compared with the original algorithm of Yen and Laih
Keywords
digital arithmetic; public key cryptography; exponentiation computation; generalisation common-multiplicand multiplications; k-times folding technique; multiplications algorithm; public key cryptography;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19951189
Filename
469223
Link To Document