C语言简易RSA算法实现
文章主要对RSA算法的快速模指数算法的实现,对于过大的素数不能很好的实现,鉴于能力有限可以参考其他的一些C语言库等
也曾思考过数据类型从int -> unsigned int -> long的改变等,但都是治标不治本,推荐往字符串方面思索改进。
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <windows.h>
//计算a^b mod c,快速模指数算法
int modpow(int a, int b, int c)
{
int res = 1;
while (b > 0)
{
if (b & 1)
{
res = (res * a) % c;
}
b = b >> 1;
a = (a * a) % c;
}
return res;
}
//计算gcd(a,b)
int gcd(int a, int b)
{
int temp;
while (b != 0)
{
temp = b;
b = a % b;
a = temp;
}
return a;
}
//在3和n-1之间找到随机指数x,使得gcd(x,phi)=1
int randExponent(int phi, int n)
{
int e = rand() % n;
while (1)
{
if (gcd(e, phi) == 1)
return e;
e = (e + 1) % n;
if (e <= 2)
e = 3;
}
}
//用扩展欧几里得法计算n^-1 mod m
int inverse(int n, int m)
{
int a = n, b = m;
int x = 0, y = 1, x0 = 1, y0 = 0, q, temp;
while (b != 0)
{
q = a / b;
temp = a % b;
a = b;
b = temp;
temp = x;
x = x0 - q * x;
x0 = temp;
temp = y;
y = y0 - q * y;
y0 = temp;
}
if (x0 < 0)
x0 += m;
return x0;
}
//使用公共指数和模量对消息m进行编码,c = m^e Mod n
int encode(int m, int e, int n)
{
return modpow(m, e, n);
}
//用私有指数和公共模量解码密码c,m = c^d Mod n
int decode(int c, int d, int n)
{
return modpow(c, d, n);
}
int main(void)
{
int p, q, phi, e, d, n, c, m = 19;
double run_time;
printf("\n请输入第一个素数p:");
scanf("%d", &p);
printf("\n请输入第二个素数q:");
scanf("%d", &q);
n = p * q;
phi = (p - 1) * (q - 1);
while (1)
{
printf("\n请输入选择的整数e:");
scanf("%d", &e);
if (e > 1 && e < phi)
{
if (gcd(e, phi) == 1)
break;
else
printf("\n输入整数e错误!");
}
else
printf("\n输入整数e错误!");
}
LARGE_INTEGER time_start;//开始时间
LARGE_INTEGER time_over;//结束时间
double dqFreq;//计时器频率
LARGE_INTEGER f;//计时器频率
QueryPerformanceFrequency(&f);
dqFreq=(double)f.QuadPart;
QueryPerformanceCounter(&time_start);//计时开始
printf("\n所以公钥为 (%d, %d) ... ", e, n);
d = inverse(e, phi);
printf("\n计算模反元素d, d = %d...\n获得密钥 (%d, %d) ... ", d, d, n);
c = encode(m, e, n);
printf("\n密文c = %d", c);
m = decode(c, d, n);
printf("\n执行解密...\n解密明文c = %d", m);
//计时结束
QueryPerformanceCounter(&time_over);//计时结束
run_time=1000000*(time_over.QuadPart-time_start.QuadPart)/dqFreq;
printf("\n总计用时: %.2f us\n", run_time);
return EXIT_SUCCESS;
}