Rabin数字签名 代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<random>
using namespace std;
const int S = 10;
long long mult_mod(long long a, long long b, long long c)
{
a %= c;
b %= c;
long long ret = 0;
while (b)
{
if (b & 1) { ret += a; ret %= c; }
a <<= 1;
if (a >= c)a %= c;
b >>= 1;
}
return ret;
}
//计算 ret = x^n %c
long long pow_mod(long long x, long long n, long long mod)//x^n%c
{
if (n == 1)return x%mod;
x %= mod;
long long tmp = x;
long long ret = 1;
while (n)
{
if (n & 1) ret = mult_mod(ret, tmp, mod);
tmp = mult_mod(tmp, tmp, mod);
n >>= <