文件包括RSA算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Documents include the RSA algorithm for the original procedures and detailed notes. Can be achieved using more than 1024 large prime numbers for encryption and decryption. Including large integer add, subtract, multiply, divide, modular exponentiation computation, and inverse calculations, as well as the large prime numbers, such as algorithms to determine. Can be extended slightly in the actual application.