RSA

一、RSA算法原理：

二、算法实现步骤

略，书上，网上都已经讲得很详细了，而且又不多，过程也不复杂！

三、算法设计原则

这里往往是大家容易忽视的地方，所以有必要提一下。

RSA算法设计原则：
1.    p,q长度仅应相差几位
2.    (p-1),(q-1)都应有一个大的素数因子
3.    gcd(p-1,q-1)应该较小
4.    d>=n^(1/4)

方法：
1.选取gcd(p-1,q-1)=com在范围ushort内
2.在usigned short~unsigned int内选取两个互异的大素数p',q'
3.p=p'*com+1,q=q'*com+1
4.若gcd(p,q)!=1执行2
第一个条件必须p,q各位异或得1的位数要尽可能的少,不知道如何实现，

用abs( p - q ) <= eps 代替。
M=C^d mod n = ( M^e mod n )^d mod n =M^(e*d) mod n=M mod n
e*d mod phi(n) =1
要求gcd(M,n)=1 而 n=p*q所以p,q>M则gcd(M,n)恒立! M为unicode值，2字节，

因此p,q选(ushort,uint]里的质数就可以了。本人为人方实现所以选择了（ushort,uint]

范围内的质数，实际是10^75~10^100之间。

 

 

 

 

四、原代码：

 

1.main.cpp

# include "variable.h" # include "millerRabin.h" # include "getVariable.h" # include "crypetion.h" ///64bit的密钥 int main ( ) { srand ( ( unsigned ) time ( NULL ) ) ; fstream fin ( "message.in" ) ; fin.getline ( m , sizeof ( m ) , EOF ) ; // printf ( "%s/n" , m ) ; ull p , q , n , e , d ; getVariable ( p , q , n , e , d ) ; /* printf ( "%I64u %I64u %I64u %I64u %I64u/n" , p , q , n , e , d ) ; if ( millerRabin ( p ) && millerRabin ( q ) && p * q == n && multiMod ( e , d , ( p -1 ) * ( q - 1 ) ) == 1 ){ cout<<1<<endl; } else cout<<0<<endl; */ printf ( "公钥：%I64u/n/n" , e ) ; printf ( "私钥：%I64u/n/n" , d ) ; encrypt ( m , e , n ) ; printf ( "密文输出：/n/n%s" , c ) ; printf ( "/n/n" ) ; decrypt ( c , d , n ) ; printf ( "明文输出：/n/n/n%s/n/n" , m ) ; return 0 ; }

2.cryption.h

//对每一个明文字符加密得到一个64bit(__int64)的整数转换成十进制后有20位，因此密文每20个字符对应明文的一个unicode值 void encrypt ( char * m , ull e , ull n ) { int i ; for ( i = 0 ; m [ i ] != '/0' ; i ++ ) { cP += sprintf ( cP , "%020I64u" , powerMod ( m [ i ] , e , n ) ) ; // char to ull } } void decrypt ( char * c , ull d , ull n ) { int i , cnt = ( cP-c ) / 20 ; cP = c ; ull cc ; for ( i = 0 ; i < cnt ; i ++ ) { sscanf ( cP , "%20I64u" , & cc ) ; mP += sprintf ( mP , "%c" , powerMod ( cc , d , n ) ) ; cP += 20 ; } }

3.getVariable.h

ull exgcd(ull a,ull b,ull &x,ull &y){ if( b == 0 ) { x = 1; y = 0; return a; } else{ ull x1,y1; ull d = exgcd ( b , a % b , x1 , y1 ); x = y1; y= x1 - a / b * y1; return d; } } ull gcd( ull a, ull b ){ ull t; while ( b ) { t = b ; b = a % b ; a = t ; } return a ; } bool isOk ( uint p ) { if (p > SHORTMAX +1 && millerRabin ( p ) ) return true ; //p<=INTMAX显然成立 else return false ; } uint getPrime( ushort com ) { uint p ; ushort rnd ; do { do { rnd = rand ( ) % ( SHORTMAX -1 ) + 2 ;//[2,SHORTMAX] } while ( ! millerRabin ( rnd ) ) ; p = rnd * com + 1 ;//(ushort,uint] } while ( ! isOk ( p ) ) ; return p ; } void getVariable ( ull & p , ull & q , ull & n , ull & e , ull & d ) { ushort com ; //common diviser do { do {//get common diviser com = rand() % ( SHORTMAX - 1 ) + 2 ;//[2,SHORTMAX] } while ( com & 1 ) ; p = getPrime ( com ) ;//get prime number of p q = getPrime ( com ) ;//get prime number of q } while ( abs ( p - q ) > eps ) ; // n = p * q ; //get module ull EulerValue = ( p -1 ) * ( q - 1 ) ;//get eulerValue do {//produce a private key d = rand() % ( ((ull)~0)-SHORTMAX ) + SHORTMAX + 1 ; //(SHORTMAX,ullMAX]>n^(1/4) } while ( gcd ( d , EulerValue ) != 1 ) ; ull reverseOfEulerValue ;//欧拉值对模d的逆元 exgcd ( d , EulerValue , e , reverseOfEulerValue ) ; //求私钥对应的公钥用扩展欧几里德，公式(e*d) mod phi(n) = 1 e = ( e % EulerValue + EulerValue ) % EulerValue ; //变换到有限域Z(EulerValue)中 }

4.millerRabin.h

//可设置测试次数 //不要忘了这句：srand(unsigned(time(NUull))); ull multiMod(ull a,ull b,ull m){//s=(a*b)(mod m) (n<2^62) // return ( (a%m) * (b%m) ) % m; // this wiull overflow! a %= m; b %= m; ull s = 0; while( b ) { if(b & 1) { s += a; if(s >= m) s -= m; } a <<= 1; b >>= 1;//a*b=(a*2)*(b/2) if(a >= m) a -= m; } return s; } ull powerMod ( ull a , ull p , ull n ) { ull k = 1 ; while ( p != 1 ) { if ( p & 1 ) { k = multiMod ( k , a , n ) ; } p >>= 1 ;//a^p=(a^2)^(p/2) a = multiMod ( a , a , n ) ; } return multiMod ( a , k , n ) ; } bool witness(ull a, ull n) { //test wether a^(n-1)%n=1 or not //n-1=2^k*q ull q = n - 1; int k = 0; while( ( q &1 ) == 0 ) { k ++ ; q >>= 1 ; } //a^(2^i*q)%n=1 or n-1 (-1<i<=k) ull y , x = powerMod(a, q, n); if (x == 1 || x == n-1) return false; /* while(k --) { x = x * x % n; if (x == n-1) return false;//素数的个数少数合数，先判断素数效率低一些! } return true; */ while( k -- ){ y = multiMod ( x , x , n ) ; if(y == 1 && x != 1 && x != n-1 ) return true;//素数的个数少数合数，先判断合数效率高一些! x = y; } if ( y != 1 ) return true; // composite return false; //may be prime } bool millerRabin(ull n, int T = 10) { if (n == 2) return true; if ((n&1) == 0 || n < 2) return false; while(T --) { ull a = rand() % (n-1) + 1;// a>=1 && a<=n-1 if (witness(a, n)) return false; } return true;

5.variable.h

# include < fstream > # include < iostream > # include < cstdlib > # include < ctime > using namespace std ; typedef unsigned __int64 ull ; typedef unsigned int uint ; typedef unsigned short ushort ; const ushort SHORTMAX = ( ushort ) ~ 0 ; const uint INTMAX = ( ( unsigned int) ~ 0 ) ; const uint eps = 1000000 ; char m [ 40000 ] , c [ 800000 ] ; char * mP = m , * cP =c ;

6.message.in

输入明文，可自定义！

My first blog entry also is my first english math proof ( GCD(a,b)=min{a*x+b*y, a*x+b*y>0} ) 收藏 theorem 31.2 If a and b are any integers,not both zero,then GCD(a,b) is the smallest positive element of the set {a*x+b*y} of linear combination of a and b. Proof: 1.Let s be the smallest positive element in the set {ax+by},q=(int)a/s. then a mod s=a-q*s=a-q*(a*x+b*y)=(a-q*a)*x-q*b*y. that means a mod s also is a linear combination of the a and b. Besides,a mod s<s and s is the smallest element in the set. Therefore a mod s should be a nonpositive integer,but acutually a mod s>=0. Thus,a mod s must be equal to zero. so s|a. By analogous reasoning,we could get s|b,then s|GCD(a,b). 2.On the other hand,GCD(a,b)|a and GCD(a,b)|b, so GCD(a,b)|(a*x+b*y),then GCD(a,b)|s. beacause GCD(a,b)|s and s|GCD(a,b),we could conclude that GCD(a,b) is equal to s. I'ts a original edition ,I wish everyone wants to reproduce indicate the source.

原创，转载请注明！