.png){kind=icon}
Return
New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2016.2599269.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we derive new computational techniques for residue number systems (RNSs)-based Barrett algorithm (BA). The focus of this paper is an algorithm that carries out the entire computation using only modular arithmetic without conversion to large integers via the Chinese remainder theorem. It also avoids the computationally expensive scaling-rounding operation required in the earlier work. There are two parts to this paper. First, we set up a new BA using two constants other than powers of two. Second, an RNS-based BA is described. A complete mathematical framework is described including proofs of the various steps in the computations and the validity of results. Third, we present a computational algorithm for RNS-based BA. Fourth, the RNS-based BA is used as a basis for new RNS-based algorithms for MoM and MoE. The applications we are dealing with are in the area of cryptography.
Keywords:
Barrett algorithm (BA)
montgomery multiplication (MM)
residue number systems (RNS)
chinese remainder theorem (CRT)
Barrett modular multiplication (BMM)
modular multiplication (MoM)
modular exponentiation (MoE)
mixed radix systems (MRS)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more