// KEY_PRODUCE.h: interface for the CKEY_PRODUCE class.
//
//////////////////////////////////////////////////////////////////////
//==本程序提供密鑰產(chǎn)生的一些基本數(shù)學(xué)實(shí)現(xiàn)
#if !defined(AFX_KEY_PRODUCE_H__11AA2A94_D7F2_4237_95B2_53B62E156FEE__INCLUDED_)
#define AFX_KEY_PRODUCE_H__11AA2A94_D7F2_4237_95B2_53B62E156FEE__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include <math.h>
class CKEY_PRODUCE  
{
public:
	int JudgePrime(unsigned int prime);//==========判prime是否為素?cái)?shù)
	//============================================算出p*q的歐拉值
	int Count_N_AoLa_Num(unsigned int p, unsigned int q, unsigned int * ao_la);
	//============================================求兩個(gè)數(shù)的最大公因數(shù)
	unsigned int CountCommonData(unsigned int a, unsigned int b);
	//=============================================隨機(jī)選擇公鑰e
	int RandSelect_e( unsigned int ao_la, unsigned int* e );
	//=============================================求b的e次方除d的余數(shù)
	unsigned int GetOutNum(unsigned int b,unsigned int e , unsigned int d);
	//=============================================求任意大于2的整數(shù)的歐拉值
	unsigned int CountAnyNumAola(unsigned int number);
	//=============================================產(chǎn)生RSA 公_私 密鑰
	int Produce_RSA_Key(unsigned int p,unsigned int q, unsigned int* Ke, unsigned int* Kd, unsigned int* model);
	//===========================利用加的模等于模的加求e*d = 1 mod model 中的d
	int OverOneNum(unsigned int e,unsigned int model, unsigned int* d);
	CKEY_PRODUCE();
	virtual ~CKEY_PRODUCE();
	
};

#endif // !defined(AFX_KEY_PRODUCE_H__11AA2A94_D7F2_4237_95B2_53B62E156FEE__INCLUDED_)