本程序使用了欧几里得算法求乘法逆元，采用二进制分解算法求a^b mod n,算法简明，思路清晰，适合深入了解程序的基本原理，直接运行demo文件即可完成程序的运行。-This program uses the Euclidean Algorithm for Finding multiplicative inverse, using the binary decomposition algorithm for getting a ^ b mod n, algorithm concise, clear, for in-depth understanding of the basic principles of the program, run the demo file directly to complete the program running