.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
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总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Computer-aided human factors analysis of the industrial vehicle driver cabin to improve occupational health工业车辆驾驶室的计算机辅助人为因素分析以改善职业健康
PREAI
分享收藏分享收藏分享收藏
分享收藏
查看更多内容