A FAST MODULAR MULTIPLICATION ALGORITHM

被引:0
|
作者
CHIOU, CW [1 ]
机构
[1] CHUNG SHAN INST SCI & TECHNOL,CHUNG SHAN,TAIWAN
关键词
MODULAR MULTIPLICATION; MODULAR EXPONENTIATION; PUBLIC-KEY CRYPTOSYSTEM; CRYPTOGRAPHY; PARALLEL PROCESSING;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Most public-key cryptosystems are constructed based on a modular exponentiation, which must be further decomposed into a series of modular multiplications. Therefore, modular multiplication must be speeded up. A new modular multiplication algorithm is proposed. The algorithm reduces the execution time by 66% compared with conventional ones by spending the same amount of hardware.
引用
收藏
页码:11 / 17
页数:7
相关论文
共 50 条