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.<
Published in:
Electronics Letters
(Volume:29
,
Issue:
17
)
Date of Publication: 19 Aug. 1993