1) Montgomery reduction algorithm
Montgomery约化
1.
Chinese Remainder Theorem and M-ary algorithm are used together with Montgomery reduction algorithm to re-design the operation course via analysis of the algorithm structure, and proposed a transmuted M-ary algorithm based on the reduction of pre-computation.
RSA是公开密码体系中应用最广泛的算法,通过对算法结构的分析,运用中国剩余定理、M-ary乘方以及Montgomery约化等方法对RSA的运算过程进行了重新设计,提出了一种减少预计算数的M-ary算法,并结合TI公司TMS320C6201高性能DSP的流水特点,对模幂运算中用得最频繁的模平方运算进行了优化,提高了计算的速度。
2) Montgometry's sieve
Montgomery 筛法
3) Montgomery multiplication
Montgomery模乘
4) Montgomery modular multiplication
Montgomery模乘
1.
This paper presents several popular algorithms of producing large prime numbes,and gives a algorithm which bases on Miller-Rabin prime detection algorithm and modular exponentiation algorithm based on Montgomery Modular Multiplication algorithm to rapidly generate large prime numbers.
并给出了Miller-Rabin检测素数算法和基于Montgomery模乘算法的模幂算法快速生成大素数算法。
2.
Montgomery modular multiplication(MMM) plays a crucial role in the implementation of modular exponentiations of public-key cryptography.
在公钥密码实现中,Montgomery模乘扮演着非常重要的角色。
3.
Through a research on the property of Montgomery modular multiplication,the Pollard Phro、(P-1) and P+1 algorithms are modified respectively so that the classic modular multiplication can be replaced by Montgomery modular multiplication.
文章针对Montgomery模乘的特点,分别对Pollard Phro、P-1和P+1算法进行适当的改造,使得底层的经典模乘运算可以由Montgomery模乘来代替。
5) Montgomery algorithm
Montgomery算法
1.
Montgomery algorithm on elliptic curves over finite fields of character three;
特征3有限域上椭圆曲线的Montgomery算法
2.
Works at the common generating algorithms,that is,certain generating algorithms and probabilistic generating algorithms,and demonstrates a programming algorithm based on Miller-Rabin algorithm improved by Montgomery algorithm and Pocklington .
文中在研究了密钥生成的一般算法的基础上,即确定性素数产生和概率性素数产生方法,给出了利用Montgomery算法优化的Miller-Rabin算法和Pocklington定理算法实现,构造了大素数的生成算法,以提高RSA算法的安全性和运行速度。
3.
Montgomery algorithm is a fast modular multiplication algorithm and is widely used in the base operation of public-key cryptography algorithms such as RSA and ElGamal.
Montgomery算法作为一种快速模乘算法,常被应用于RSA、ElGamal等公钥密码算法的基本运算。
6) montgomery inversion
Montgomery模逆
补充资料：公理化方法(见公理化和形式化)
公理化方法(见公理化和形式化)
axiomatical method
gongllbuafangfa公理化方法化和形式化。(axiomatieal method)见公理
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条