RSA算法实验代码.docx

RSA算法实验代码#include #define MAX_NUM 63001#define MAX_PRIME 251/! 返回代码#define OK 100#define ERROR_NOEACHPRIME 101#define ERROR_NOPUBLICKEY 102#define ERROR_GENERROR 103unsigned int MakePrivatedKeye( unsigned int uiP, unsigned int uiQ );unsigned int GetPrivateKeye( unsigned int iWhich );unsigned int MakePairkey( unsigned int uiP, unsigned int uiQ, unsigned int uiD );unsigned int GetPairKey( unsigned int &d, unsigned int &e );int rsa_encrypt( int n, int e, int mw,int p,int q);int rsa_decrypt( int n, int d, int cw, int p,int q);void outputkey();/!保存私钥d集合struct pKeysetunsigned int set MAX_NUM ;unsigned int size;pset;/! 保存公、私钥对struct pPairkeyunsigned int d;unsigned int e;unsigned int n;pairkey;/ 名称：isPrime/ 功能：判断两个数是否互质/ 参数：m: 数a; n: 数b/ 返回：m、n互质返回true; 否则返回falsebool isPrime( unsigned int m, unsigned int n )unsigned int i=0;bool Flag = true;if( m2 | n n ) ? n : m;for( i=2; i=tem & Flag; i+ )bool mFlag = true;bool nFlag = true;if( m % i = 0 )mFlag = false;if( n % i = 0 )nFlag = false;if( !mFlag & !nFlag )Flag = false;if( Flag )return true;elsereturn false;/ 名称：MakePrivatedKeye/ 功能：由素数P、Q生成公钥e/ 参数：uiP: 素数P; uiQ: 素数Q/ 返回：私钥dunsigned int MakePrivatedKeye( unsigned int uiP, unsigned int uiQ )unsigned int i=0;/! 得到所有与z互质的数( 私钥d的集合 )unsigned int z = ( uiP -1 ) * ( uiQ -1 );pset.size = 0;for( i=0; iz; i+ )if( isPrime( i, z ) )pset.set pset.size+ = i;return pset.size;/ 名称：MakePairKey/ 功能：生成RSA公、私钥对/ 参数：uiP: 素数P; uiQ: 素数Q; uiD: 私钥d/ 返回：错误代码unsigned int MakePairkey( unsigned int uiP, unsigned int uiQ, unsigned int uiD )bool bFlag = true;unsigned int i = 0, d;unsigned int z = ( uiP-1 ) * ( uiQ-1 );unsigned int e = pset.setuiD;if( !isPrime( z, e ) )return ERROR_NOEACHPRIME;for( i=2; i= iWhich )return pset.set iWhich ;elsereturn 0;/ 名称：rsa_encrypt/ 功能：RSA加密运算/ 参数：d: 公钥n; e: 私钥e; mw: 加密明文; cw: 密文输出/ 返回：无int rsa_encrypt( int d, int e,int mw, int p,int q)int i, j=0,cw;int temInt ;temInt = mw;i=p*q;/*/for( j=1; je; j+ )temInt = temInt * mw ;temInt = temInt % i;cw= temInt;return cw;/ 名称：rsa_decrypt/ 功能：RSA解密运算/ 参数：d: 公钥n; d: 私钥d; cw: 密文; cLength: 密文长度; mw: 明文输出/ 返回：无int rsa_decrypt( int d, int e, int cw, int p,int q )int i, j=-1,mw;int temInt = 0;i=p*q;mw= 0;temInt = cw;/printf(temInt %dn,temInt);/printf(d %d;e %dn; mW %d;p %d;q %d,d,e,cw,p,q);if( d != 0 )for( j=1; jd; j+ )temInt = temInt * cw ;/printf(temInt1 %dn,temInt);temInt=temInt% i;/printf(temInt2 %dn,temInt);mw = temInt;/printf(mw %dn,mw);return mw;void outputkey()printf(PublicKey(e,n): (%d,%d)n,pairkey.e,pairkey.n);printf(PrivateKey(d,n): (%d,%d)n,pairkey.d,pairkey.n);/! 程序主函数int main( )int mingwen ,miwen=0,miwen1,mw;unsigned int p , q , d , n , e;/two prime p & q, public key(n, e) , private key(n , d)printf(输入p：);scanf(%d,&p);printf(输入q：);scanf(%d,&q);while(isPrime(p,q)!=1)printf(输入的数不是质数，请重新输入n);printf(p：);scanf(%d,&p);printf(q：);scanf(%d,&q);n=MakePrivatedKeye(p, q);printf(产生的私钥的长度为%dn,n);printf(输入小于私钥长度的数:n);scanf(%d,&d);MakePairkey(p, q, d );outputkey();printf(请输入明文：n);scanf(%d,&mingwen);miwen=rsa_encrypt( pairkey.d , pairkey.e,mingwen,p,q);pri