Sung‐Ming Yen, Chi‐Sung Laih
Abstract
Efficient computations of {X + Yi|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.
OpenAlex reports 34 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Efficient computations of {X + Yi|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.
Key concepts: Exponentiation, Multiplication (music), Modular exponentiation, Cryptography, Public-key cryptography, Key (lock), Arithmetic, Computation