heck_prime.h

RSA对称、非对称加密解密算法

#include "bigint.h"

class Check_Prime
{
public:
	CBigInt number;
	Check_Prime(void);
	~Check_Prime(void);
	//小素数测试
	unsigned int small_prime_check(unsigned int *small_prime);
	//产生小素数
	void generate_small_prime(unsigned int mymax);
	//素数检验
	unsigned int prime_check(unsigned int *small_prime,unsigned int iterator);
	//素数默认检验
	unsigned int prime_check(unsigned int iterator);

	//分解n-1=2的k次方*q;
	unsigned int Fact_Two(CBigInt n,CBigInt& q);

	//生成需要位数相近的素数
	
};