ScholarLens Back to search
1995•Electronics LettersRequires access

Improved generalisation common-multiplicandmultiplications algorithm of Yen and Laih

Chung‐Hsien Wu, Yuh-Shihng Chang

Open publisher page 22 citations

Abstract

Yen and Laih 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.

About this research paper

What this paper is about

Yen and Laih 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.

Why it matters

OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Yen and Laih 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.

Key concepts: Exponentiation, Computation, Multiplication (music), Arithmetic, Computer science, Algorithm, Key (lock), Modular exponentiation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved generalisation common-multiplicandmultiplications algorithm of Yen and Laih — Research Paper | ScholarLens