| 快速实现数字签名的宏观加模算法 |
| |
| 引用本文： | 罗英辉,陈忆群.快速实现数字签名的宏观加模算法[J].计算机工程与应用,2007,43(10):117-120. |
| |
| 作者姓名： | 罗英辉 陈忆群 |
| |
| 作者单位： | 广东教育学院,计算机科学系,广州,510303 |
| |
| 摘 要： | 提出一种宏观累加模的快速模幂乘的算法,将乘法运算和求模运算转换成简单的移位运算和加法运算,从而避免了求模运算和减少大数相乘次数。实验表明,本算法可以用接近n/2次n-bit的加法运算即可实现A×BmodN运算,在宏观上看,计算C=me要比Montgomery等算法快2倍。
|
| 关 键 词： | 模乘 模幂 反复平方乘 数字签名 |
| 文章编号： | 1002-8331（2007）10-0117-04 |
| 修稿时间： | 2006-08 |
Macroscopy addition and modular algorithm speed up digital signature |
| |
| LUO Ying-hui,CHEN Yi-qun.Macroscopy addition and modular algorithm speed up digital signature[J].Computer Engineering and Applications,2007,43(10):117-120. |
| |
| Authors: | LUO Ying-hui CHEN Yi-qun |
| |
| Affiliation: | Department of Computer Science,Guangdong Institute of Education,Guangzhou 510303,China |
| |
| Abstract: | This paper presents a new algorithm to realize modular exponentiation multiplication by converting multiplication and modular operation into the simple shift and addition operation,thus avoiding modular operation on large number.Experiment shows that our algorithm speeds up the modular exponentiation multiplication remarkably:it realize A×B mod N in n/2 times n-bit addition operation.It's time cost for C=me is a half of the Montgomery algorithm. |
| |
| Keywords: | modular multiplication modular exponentiation repeated square-and-multiply digital signature |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
