STILL FASTER MODULAR MULTIPLICATION

被引：15
|
作者：
WALTER, CD
机构：
[1] Computation Department, UMIST, Manchester M60 1QD, PO Box 88, Sackville Street
来源：
ELECTRONICS LETTERS | 1995年 / 31卷 / 04期
关键词：
DIGITAL ARITHMETIC; CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;
D O I：
10.1049/el:19950217
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
By an appropriate choice of the modulus used in RSA cryptography, it is possible to simplify the hardware for performing the required modular multiplication steps, and thereby increase the speed of encryption and decryption. The author considers this when the algorithm of Montgomery is used.
引用
收藏
页码：263 / 264
页数：2
相关论文
共 50 条
12345