素数分解两种实现算法

RSA System and Implementing the Arithmetic on Resolveing Large Prime Number

用计算机做大素数分解,基于计算复杂性理论原理,当分解的素数是NP一完全问题的时候,采用了二种查找验算程序即:试除法、素数因子法、并给出了算法流程图和程序清单。

This paper talks about resolveing large prime number with computer.The principle is based on the complexity theory of calculation.It gives two ways to do that,Computer programms are shown,too.