rsa.zip_C语言 RSA_RSA算法大素数_rsa_大素数_素数

#include "windows.h" #define MAXSIZE 0x10000 #define MAXLEN 160 #define DEC 10 #define HEX 16 //#define system 10 #pragma comment( lib, "xmlParser4Etri.lib" ) char *srcfile="c:\\test.xml"; char *resfile="c:\\result.xml"; #pragma warning(disable:4700)//애러메시지를 나타나지 않게 함 #pragma warning(disable:4101) typedef struct BInt{ int Length; int Value[MAXLEN]; }BInt; BInt Q,*Qp,P,*Pp,N,*Np,N2,*N2p,D,*Dp,E,*Ep,F1,F2,F3,*F1P,*F2P,*F3P; char word[1000]; const static int PrimeTable[550]= { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581 }; //************************************************************************** BInt* init(BInt *x); int comp(BInt *x, BInt *y); BInt addi(BInt *x, int b); BInt adds(BInt *x, BInt *y); BInt subi(BInt *x, int y); BInt subs(BInt *x, BInt *y); BInt muli(BInt *x, int y); BInt muls(BInt *x, BInt *y); BInt divi(BInt *x,int y); BInt divs(BInt *x, BInt *y); int modi(BInt *x,int y); BInt mods(BInt *x, BInt *y); //************************************************************************** int RaMe(BInt *x); BInt Mongmery(BInt *m, BInt *e, BInt *n); BInt get(); void put(BInt *x); BInt getprime(int k); BInt euc(BInt *x, BInt *y); BInt euc2(BInt *x, BInt *y); //************************************************************************** BInt euc2(BInt *x, BInt *y) { BInt A,B,C,*Ap,*Bp,*Cp; Ap=&A;Bp=&B;Cp=&C; A=*x; B=*y; while(!(B.Length==1 && B.Value[0]==0)) { C=mods(Ap,Bp); A=B; B=C; } return A; } BInt euc(BInt *x, BInt *y) { BInt M,E,X,Y,I,J,*Mp,*Ep,*Xp,*Yp,*Ip,*Jp; int a,b; Mp=&M;Ep=&E;Xp=&X;Yp=&Y;Ip=&I;Jp=&J; Xp=init(Xp);Yp=init(Yp);Ip=init(Ip);Jp=init(Jp); M=*y;E=*x; Y.Value[0]=1; a=b=1; while((E.Length!=1)||(E.Value[0]!=0)) { I=divs(Mp,Ep); J=mods(Mp,Ep); M=E; E=J; J=Y; Y=muls(Yp,Ip); if(a==b) { if(comp(Xp,Yp)!=2)Y=subs(Xp,Yp); else{Y=subs(Yp,Xp);b=0;} } else{Y=adds(Xp,Yp);a=1-a;b=1-b;} X=J; } if(a==0)X=subs(y,Xp); return X; } BInt getprime(int k) { BInt x,*xp,y,*yp,zero,*zerop; int a,b,size; unsigned c; xp=&x;yp=&y;zerop=&zero;zerop=init(zerop);yp=init(yp); a=b=c=0; size=40; if(k==1)c=(unsigned)time(NULL); else c=(unsigned)(time(NULL)*2); first: srand(c); xp=init(xp); for(a=1;a<size-1;a++) x.Value[a]=abs((rand()*rand())%MAXSIZE); x.Value[0]=(rand()%1000)*10+1; x.Value[size-1]=rand()%MAXSIZE; xp->Length=size; //ViewBInt(xp); for(a=0;a<100;a++) { b=modi(xp,PrimeTable[a]); if(b==0){ c=c+100;goto first;} } //put(xp); b=RaMe(xp); //printf("%d\n",b); if(b==0) {c=c+1000;goto first;} //put(xp); return x; } void put(BInt *x) { int a,b,system; char t[16]="0123456789ABCDEF",ch; BInt X,*Xp; Xp=&X; Xp=init(Xp); X=*x; system=16; for(a=0;a<1000;a++)word[a]='\0'; a=0; while(X.Value[X.Length-1]>0) { b=modi(Xp,system); ch=t[b]; word[a]=ch; X=divi(Xp,system); a++; } strrev(word); printf("\n"); printf("%s\n", word); } BInt get() { BInt x,*xp; char word[1000],*prime="17475243319617581867"; int a,len,system,k; xp=&x; system=16; for(a=0;a<1000;a++)word[a]='\0'; //printf("Input Big Integer!\n"); //scanf("%s",word); len=strlen(word); xp=init(xp); for(a=0;a<len;a++) { x=muli(xp,system); if((word[a]>='0')&&(word[a]<='9'))k=word[a]-48; else if((word[a]>='A')&&(word[a]<='F'))k=word[a]-55; else if((word[a]>='a')&&(word[a]<='f'))k=word[a]-87; else k=0; x=addi(xp,k); } //printf("%s\n",word); return x; } BInt Mongmery(BInt *m, BInt *e, BInt *n) { BInt x,y,z,*xp,*yp,*zp,res,*resp,two,*twop,zero,*zerop; int com1,com2; xp=&x;yp=&y;zp=&z,resp=&res,twop=&two,zerop=&zero; x=*m;y=*e;z=*n; twop=init(twop); resp=init(resp); zerop=init(zerop); res.Value[0]=1; two.Value[0]=2; //printf("시작!\n"); com1=comp(yp,zerop); while(com1!=0) { while(y.Value[0]%2==0) { y=divs(yp,twop); x=muls(xp,xp); x=mods(xp,zp); if(y.Length==1 && y.Value[0]==1)break; } y=subi(yp,1); res=muls(resp,xp); res=mods(resp,zp); //put(yp); com1=comp(yp,zerop); } return res; } int RaMe(BInt *x) { BInt b,m,j,v,i,zero; BInt a,c; BInt *pb,*pm,*pj,*pv,*pi,*pzero,*pa,*pc,test,*ptest; int czero,rn,com1,com2,com3; pb=&b; pm=&m; pj=&j; pv=&v; pi=&i; ptest=&test; pzero=&zero; pa=&a; pc=&c; ptest=init(ptest); pzero=init(pzero); pc=init(pc); pa=init(pa); pb=init(pb); pm=init(pm); pj=init(pj); pv=init(pv); pi=init(pi); a.Value[0]=2; c.Value[0]=1; m=subi(x,1); test=divi(pm,2); czero=comp(ptest,pzero);//변화할까? while(czero==0) { j=addi(pj,1); m=divs(pm,pa); test=divi(pm,2);