Faster Modular Multiplication by Operand Scaling
Faster Modular Multiplication by Operand Scaling
复制标题
通过操作数缩放加快模乘法
DOI：
10.1007/3-540-46766-1_26
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
C. D. Walter
中科院分区：
文献类型：
--
作者：
C. D. Walter
有许多已知的技术可以加速模乘，这是RSA密码中的主要算术运算。这篇笔记展示了如何通过缩放模数来提高速度。所得到的硬件只受加法速度的限制。对扇出的详细分析表明，与现有方法相比，加速可能高达两倍。这是因为加法和扇出现在可以并行完成。当然，在RSA中，可以选择不需要缩放的模数，这样就消除了大部分微小的额外成本。
There are a number of techniques known for speeding up modular multiplication, which is the main arithmetic operation in RSA cryptography. This note shows how to gain speed by scaling the modulus. Resulting hardware is limited only by the speed of addition. Detailed analysis of fan out shows that over existing methods the speedup is potentially as much as two-fold. This is because the addition and fan out can now be done in parallel. Of course, in RSA the modulus can be chosen to need no scaling, so that most of the minor extra costs are eliminated.