Fast Modular Exponentiation 快速模幂运算
Modular-Exponentiation Operation 模幂算法
large integer modular exponentiation 大数模幂
modular exponentiation algorithm 模幂算法
Modular Exponentiation Group 模求幂组
modular exponentiation multiply 模幂乘
algorithm of modular exponentiation 方幂模算法
Different from binary method of modular exponentiation,the article introduces a faster and more effective sliding window method combined with Montgomery algorithm and the CRT(Chinese Remainder Theory). The flow charts of signature and verification are also given.
不同于常规的二进制幂模算法,该文采用一种更快速有效的滑动窗口法来实现幂模运算,同时结合Montgomery算法和中国剩余定理相结合来实现RSA签名,并给出了签名和验证的流程图。
参考来源 - 一种RSA算法之数字签名系统的快速实现方案 in CAnd then, we propose new modular exponentiation algorithmsagainst SPA attacks. We further reduce them against SPA attacks under our generalizedSPA mode and compare them with similar algorithms on performance characters.
3.研究新的防御简单电源分析攻击的模幂算法。
参考来源 - 电源分析与实用防御措施的研究·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
On estimation of optimal window size in m_ary algorithm in modular exponentiation and point multiplication;
定义了大窗口和小窗口，指出经典蚁群算法实质上是大窗口蚁窗算法。
Modular exponentiation is the most common fundamental and time consuming operation in RSA public-key cryptosystems.
模幂运算是RSA公钥密码算法中最基本也是最耗时的运算。
The performance of RSA decryption has direct relationship with the efficiency of modular exponentiation implementation.
RSA算法的解密性能与大数模幂运算的实现效率有着直接的关系。
应用推荐