RSA算法实验代码.docx

RSA算法实验代码#includestdio.h#define MAX_NUM 63001#define MAX_PRIME 251//! 返回代码#define OK 100#define ERROR_NOEACHPRIME 101#define ERROR_NOPUBLICKEY 102#define ERROR_GENERROR 103unsignedintMakePrivatedKeye( unsignedintuiP, unsignedintuiQ );unsignedintGetPrivateKeye( unsignedintiWhich );unsignedintMakePairkey( unsignedintuiP, unsignedintuiQ, unsignedintuiD );unsignedintGetPairKey( unsignedint d, unsignedint e );intrsa_encrypt( int n, int e, intmw,intp,int q);intrsa_decrypt( int n, int d, intcw, intp,int q);voidoutputkey();//!　保存私钥d集合structpKeyset{unsignedint set[ MAX_NUM ];unsignedint size;}pset;//! 保存公、私钥对structpPairkey{unsignedint d;unsignedint e;unsignedint n;}pairkey;// 名称：isPrime// 功能：判断两个数是否互质// 参数：m: 数a; n: 数b// 返回：m、n互质返回true; 否则返回falseboolisPrime( unsignedint m, unsignedint n ){unsignedint i=0;bool Flag = true;if( m2 || n2 )returnfalse;unsignedint tem = ( m n ) ? n : m;for( i=2; i=tem Flag; i++ ){boolmFlag = true;boolnFlag = true;if( m % i == 0 )mFlag = false;if( n % i == 0 )nFlag = false;if( !mFlag !nFlag )Flag = false;}if( Flag )returntrue;elsereturnfalse;}// 名称：MakePrivatedKeye// 功能：由素数P、Q生成公钥e// 参数：uiP: 素数P; uiQ: 素数Q// 返回：私钥dunsignedintMakePrivatedKeye( unsignedintuiP, unsignedintuiQ ){unsignedint i=0;//! 得到所有与z互质的数( 私钥d的集合 )unsignedint z = ( uiP -1 ) * ( uiQ -1 );pset.size = 0;for( i=0; iz; i++ ){if(isPrime( i, z ) ){pset.set[pset.size++ ] = i;}}returnpset.size;}// 名称：MakePairKey// 功能：生成RSA公、私钥对// 参数：uiP: 素数P; uiQ: 素数Q; uiD: 私钥d// 返回：错误代码unsignedintMakePairkey( unsignedintuiP, unsignedintuiQ, unsignedintuiD ){boolbFlag = true;unsignedint i = 0, d;unsignedint z = ( uiP-1 ) * ( uiQ-1 );unsignedint e = pset.set[uiD];if( !isPrime( z, e ) )return ERROR_NOEACHPRIME;for( i=2; iz; i++ ){if( (i*e)%z == 1 ){d = i;bFlag = false;}}if(bFlag )return ERROR_NOPUBLICKEY;if( (d*e)%z != 1 )ERROR_GENERROR;pairkey.d = d;pairkey.e = e;pairkey.n = uiP * uiQ;return OK;}// 名称：GetPairKey// 功能：对外提供接口，获得公、私钥对// 参数：uiP: 素数P; uiQ: 素数Q; uiD: 私钥d// 返回：unsignedintGetPairKey( unsignedi