C语言RSA公钥密码的实现

先声明不支持大素数
代码：

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
 
typedef struct {
 int d;
 int x;
 int y;
} EE;
 
EE extended_euclid(int a, int b) {
 EE ee1, ee2, ee3;
 if (b == 0) {
  ee1.d = a;
  ee1.x = 1;
  ee1.y = 0;
  return ee1;
 } else {
  ee2 = extended_euclid(b, a % b);
  ee3.d = ee2.d;
  ee3.x = ee2.y;
  ee3.y = ee2.x - floor(a / b) * ee2.y;
  return ee3;
 }
}
 

int modulo(int x, int N){
    return (x % N + N) % N;
}
 
void decimal_to_binary(int op1, int aOp[]){
    int result, i = 0;
    do{
        result = op1 % 2;
        op1 /= 2;
        aOp[i] = result;
        i++;
    }while(op1 > 0);
}
 
int modular_exponentiation(int a, int b, int n){
 int *bb;
 int count = 0, c = 0, d = 1, i;
 
 
 count = (int) (log(b)/log(2)) + 1;
 
 bb = (int *) malloc(sizeof(int*) * count);
 decimal_to_binary(b, bb);
 
 for (i = count - 1; i >= 0; i--) {
  c = 2 * c;
  d = (d*d) % n;
  if (bb[i] == 1) {
   c = c + 1;
   d = (d*a) % n;
  }
 }
 return d;
}
 
int get_d(int e, int phi){
 EE ee;
 ee = extended_euclid(e, phi);
 return modulo(ee.x, phi); 
}
 
int main(int argc, char* argv[]) {
 int p, q, phi, n, e, d, m, c,f;
 printf("Enter the value of p: ");
 scanf("%d", &p);
 printf("Enter the valeu of q: ");
 scanf("%d", &q);
 n = p*q;
 phi = (p - 1) * (q - 1);
 printf("Enter the value of e: ");
 scanf("%d", &e);
 d = get_d(e, phi);
 printf("Public Key: (n = %d, e = %d)\n", n, e);
 printf("Private Key: (n = %d, d = %d)\n", n, d);
 printf("plese choose function:\n 1.encrypt \n 2.decrypt\n"); 
 scanf("%d",&f);
 switch(f)
 {
 	case 1:
 		printf("Enter message to encrypt: ");
 		scanf("%d", &m);
 		c = modular_exponentiation(m, e, n);
 		printf("Encrypted message is: %d\n", c);
 		break;
 		/*m = modular_exponentiation(c, d, n);
 		printf("Message is decrypted to %d\n", m);*/
 	case 2:
 		printf("Enter message to decrypt: ");
 		scanf("%d", &c);
 		m = modular_exponentiation(c, d, n);
 		printf("Message is decrypted to %d\n", m);
 		/*c = modular_exponentiation(m, e, n);
 		printf("Encrypted message is: %d\n", c);*/
 		break;
 }
 
 return 0;
}

运行结果：

验证：
P=3，q=11
N=p*q=33
φ(N)=(p-1)(q-1)=20
e=3
e * d % φ(N) = 1

所以d=7
加密：C ＝ ME mod N
M=2；
C=2的3次方mod 33
C=8
解密：M ＝CD mod N
M=8的7次方mod 33 =>2097152 mod 33 =>2

证明RSA代码实现成功。