自己在进行RSA的学习时写的一个BigInt类，实现了一百二十八位数的整数（十六进制的位，不是二进制的bit）的基本运算。,During the study of RSA I wrote this BigInt class implements 128-digit integer (in hex, not binary bit) of the basic operations.

大素数生成。用于加密解密。具体内容：用C或C++语言编写的一个生成二进制为1024位的大素数的程序。-Generate large prime numbers. For encryption and decryption. Specific elements: using C or C++ Language to prepare a generation of binary for the 1024 program of large prime numbers.

大整数（可高效计算数万位整数）四则运算的实现，采用了高效的9位并行计算。除法的实现更是采用了高效的二分试商-Large integer (which can be tens of thousands of high-performance computing-bit integer) arithmetic to achieve efficient use of parallel computing 9. The division is the adoption of a more efficie

此代码完成了大整数（BigInt）的计算功能。作为N进制计算的基础代码，可继续拓展。-Completed a large integer code (BigInt) of computing. As the basis for calculating N binary code, can continue to expand.