rsa加密过程中需要大数的幂运算后求模，本程序即计算a的b次方的结果对c求模，其中a,b,c均为大自然数,编写rsa加密的朋友可以作为参考(其实就是rsa的精华)-rsa encryption need computing power of large numbers after the seek mode, the procedure to calculate a result of the b-th power of c for mold, which a, b, c are the num