摘要
文章针对Montgomery模乘的特点,分别对Pollard Phro、P-1和P+1算法进行适当的改造,使得底层的经典模乘运算可以由Montgomery模乘来代替。实验结果表明,在使用了Mont-gomery模乘之后,这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. The experiment shows that the use of Montgomery modular multiplication brings great benefit for the three factoring algorithms.
出处
《信息工程大学学报》
2006年第4期326-329,共4页
Journal of Information Engineering University
基金
国家自然科学基金资助项目(91104035)
