ScholarLens Back to search
2008•IET Computers & Digital TechniquesRequires access

Efficient residue number system iterative modular multiplication algorithm for fast modular exponentiation

J. H. Yang, Chin‐Chen Chang

Open publisher page 6 citations

Abstract

An efficient residue number system (RNS) iterative modular multiplication algorithm is proposed. Compared with the previous researches, the proposed algorithm is superior for implementing the modular exponentiation in RNS. Besides, the way to extend the proposed algorithm to fast modular exponentiation in RNS is also shown. Using the proposed extension technique, the algorithm can be easily and efficiently applied to any other square-and-multiply methods for fast modular exponentiation in RNS.

About this research paper

What this paper is about

An efficient residue number system (RNS) iterative modular multiplication algorithm is proposed. Compared with the previous researches, the proposed algorithm is superior for implementing the modular exponentiation in RNS. Besides, the way to extend the proposed algorithm to fast modular exponentiation in RNS is also shown. Using the proposed extension technique, the algorithm can be easily and efficiently applied to any other square-and-multiply methods for fast modular exponentiation in RNS.

Why it matters

OpenAlex reports 6 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

An efficient residue number system (RNS) iterative modular multiplication algorithm is proposed. Compared with the previous researches, the proposed algorithm is superior for implementing the modular exponentiation in RNS. Besides, the way to extend the proposed algorithm to fast modular exponentiation in RNS is also shown. Using the proposed extension technique, the algorithm can be easily and efficiently applied to any other square-and-multiply methods for fast modular exponentiation in RNS.

Key concepts: Modular exponentiation, Residue number system, Modular arithmetic, Modular design, Exponentiation, Computer science, Multiplication (music), Algorithm

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Efficient residue number system iterative modular multiplication algorithm for fast modular exponentiation — Research Paper | ScholarLens