generateprime.h

一个简单的数字签名算法的实现

#include"RSA_Alogrithm.h"
#include<stdlib.h>
#include<math.h>
BIGN GetPrime(BIGN b);
bool RMTest(BIGN b);

BIGN getm(BIGN m)
{
  int i,j,k;
  bool r=false;
  unsigned short cmp=0;
  BIGN out;
  for(i=0;i<2048;i++)
  {
	  for(j=0;j<16;j++)
	  {
	     cmp=(m.value[i]>>j)<<j;
		 if(cmp==m.value[i])
			 continue;
		 else
		 {
		     r=true;
			 break;
		 }
	  }
	  if(r)
	  {
		 k=i*16+j;
         break;  
	  }
  }
  out=m.MR(k);
  return out;
}

bool RMTest(BIGN b)
{
   int j,i,hi,k;
   unsigned short sig;
   unsigned short t[2048]={0};
   BIGN temp,m,z,std1,std2;
   std1.value[0]=1;
   std2=b-std1;
   m=std2;//
   temp=m;
   for(i=2047;i>=0;i--)
   {
       if(b.value[i]>0)  
	   { 
		   hi=i;
		   break;
	   }
   }
   //get m;
   m=getm(m);

   temp.set(t);//clerar temp;
   for(i=0;i<hi;i++)
   {
       for(k=0;k<=i;k++)
		   temp.value[k]=short(rand());//generate a test BIGN;
       z=(temp.exp(m))%b;
   }

   
}
BIGN GetPrime(BIGN b)
{
   BIGN out;


   return out;
}