Modular Multiplication Hardware Algorithms with a Redundant Representation and Their Application to RSA Cryptosystem
Modular Multiplication Hardware Algorithms with a Redundant Representation and Their Application to RSA Cryptosystem
复制标题
具有冗余表示的模乘硬件算法及其在RSA密码系统中的应用
DOI：
10.1109/12.256444
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
S. Yajima
中科院分区：
文献类型：
--
作者：
N. Takagi;S. Yajima
提出了基2和基4模乘硬件算法。数字表示在一个冗余的表示和模加法执行没有进行传播。基于它们的串并行模乘器具有规则的单元阵列结构和位片特性，适合于VLSI实现。他们是有效的，特别是在应用程序中，如RSA密码系统，其中模乘法迭代执行。>
Radix-2 and radix-4 modular multiplication hardware algorithms are proposed. Numbers are represented in a redundant representation and modular additions are performed without carry propagation. Serial-parallel modular multipliers based on them have a regular cellular array structure with a bit slice feature suitable for VLSI implementation. They are efficient especially in applications, such as an RSA cryptosystem, where modular multiplications are performed iteratively. >