large prime number generation algorith 大素数生成算法的实现
In this section we simply study the theory and structure of RSA first, then the main functions are researched in detail,including the producing of the large prime number, the producing of the keypair, the processing of RSA message.
包括RSA密码算法的原理及组成，对其主要函数模块——大素数的产生、密钥对的产生和RSA消息处理分别做了详细地研究。
参考来源 - RSA密码算法体制的研究及其实现·2,447,543篇论文数据，部分数据来源于NoteExpress
The realization of RSA, contains a large prime number class, very practical.
说明：RSA的实现，内含有一个大素数类，很实用。
Finding two prime factors of a very large number is a difficult task for most computers.
对于大多数计算机来说找到一个非常大的数字的两个素因子是一件是难的事。
First, the computer must determine the factors of the large number. Then, the computer must determine if the factors are prime Numbers.
首先，计算机要找到这个数字的因子，然后该计算机还要判定这个是因子是否是素因子。
应用推荐