RSA取模运算

#include <iostream>

#include <math.h>

#include <string>

using namespace std;

int main()

{

        int base, exponent, modulo;

 cin >> base >> exponent >> modulo;

 int a = base;//底数

 int e = exponent;//指数

 int m = modulo;//模数

 long long int s = 1, ti[1000] = {}, ai[1000] = { 0 }, at[1000] = {};

 string Binary_e;

 

 while (e != 0)//用于把指数e转换为二进制Binary_e

 {

  Binary_e = (char)(e % 2 + '0') + Binary_e;

  e >>= 1; //val_/=2;

 }

 

 int sz = Binary_e.size();//字符串长度sz

 for (int i = 0; i < sz; i++)

 {

  ti[i] = Binary_e[i] - '0';//把二进制字符串Binary_e存入整型数组ti[]中

 }

 cout << endl;

 at[0] = a;

 for (int i = 0; i<sz; i++)

 {

  int j = i;

  at[j + 1] = pow(at[j], 2);

  at[j + 1] = at[j + 1] % m;

  at[j + 1] = (at[j+1] + m) % m;//记录n个 a的从2-2^n的模指数

  

  ai[i] = ti[sz - i -1] * at[i];

  if (ti[sz - i - 1] == 1)

  {

   s = (ai[i] * s) % m;//把存在的模后的数 累乘

  }

 }

 s = (s + m) % m;

 cout <<s << endl;

 system("pause");

 return s;

}