DocumentCode
947503
Title
Common-multiplicand multiplication and its applications to public key cryptography
Author
Laih, C.-S.
Volume
29
Issue
17
fYear
1993
Firstpage
1583
Lastpage
1584
Abstract
Efficient computations of (X+Y i mod i=1, 2, . . ., t; t>or=2), which is called the common-multiplicand multiplication problem, are considered. An algorithm is proposed for this problem and it is very useful for the exponentiation computations of public key cryptography.<>
Keywords
calculation; public key cryptography; algorithm; common-multiplicand multiplication; exponentiation computations; public key cryptography;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19931055
Filename
234340
Link To Document