Common-multiplicand multiplication and its applications to public key cryptography

19 August 1993

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 29 (17) , 1583-1584
https://doi.org/10.1049/el:19931055

Abstract

Efficient computations of {X + Y_i|i = 1, 2,…,t; t ≥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

EXPONENTIATION COMPUTATIONS
COMMON-MULTIPLICAND MULTIPLICATION
ALGORITHM
PUBLIC KEY CRYPTOGRAPHY

This publication has 0 references indexed in Scilit: