rsa加密算法c语言代码讲解,rsa加密解密算法c语言代码.doc

#include

#include

#include

#include

#include

#include

#define MAX 100

#define LEN sizeof(struct slink)

void sub(int a[MAX],int b[MAX] ,int c[MAX] );

struct slink

{

int bignum[MAX];

/*bignum[98]用来标记正负号，1正，0负bignum[99]来标记实际长度*/

struct slink *next;

};

/*/--------------------------------------自己建立的大数运算库-------------------------------------*/

void print( int a[MAX] )

{

int i;

for(i=0;i

printf("%d",a[a[99]-i-1]);

printf("\n\n");

return;

}

int cmp(int a1[MAX],int a2[MAX])

{ int l1, l2;

int i;

l1=a1[99];

l2=a2[99];

if (l1>l2)

return 1;

if (l1

return -1;

for(i=(l1-1);i>=0;i--)

{

if (a1[i]>a2[i])

return 1 ;

if (a1[i]

return -1;

}

return 0;

}

void mov(int a[MAX],int *b)

{

int j;

for(j=0;j

b[j]=a[j];

return ;

}

void mul(int a1[MAX],int a2[MAX],int *c)

{

int i,j;

int y;

int x;

int z;

int w;

int l1, l2;

l1=a1[MAX-1];

l2=a2[MAX-1];

if (a1[MAX-2]=='-'&& a2[MAX-2]=='-')

c[MAX-2]=0;

else if (a1[MAX-2]=='-')

c[MAX-2]='-';

else if (a2[MAX-2]=='-')

c[MAX-2]='-';

for(i=0;i

{

for(j=0;j

{

x=a1[i]*a2[j];

y=x/10;

z=x%10;

w=i+j;

c[w]=c[w]+z;

c[w+1]=c[w+1]+y+c[w]/10;

c[w]=c[w]%10;

}

}

w=l1+l2;

if(c[w-1]==0)w=w-1;

c[MAX-1]=w;

return;

}

void add(int a1[MAX],int a2[MAX],int *c)

{

int i,l1,l2;

int len,temp[MAX];

int k=0;

l1=a1[MAX-1];

l2=a2[MAX-1];

if((a1[MAX-2]=='-')&&(a2[MAX-2]=='-'))

{

c[MAX-2]='-';

}

else if (a1[MAX-2]=='-')

{

mov(a1,temp);

temp[MAX-2]=0;

sub(a2,temp,c);

return;

}

else if (a2[MAX-2]=='-')

{

mov(a2,temp);

temp[98]=0;

sub(a1,temp,c);

return;

}

if(l1

else len=l2;

for(i=0;i

{

c[i]=(a1[i]+a2[i]+k)%10;

k=(a1[i]+a2[i]+k)/10;

}

if(l1>len)

{

for(i=len;i

{

c[i]=(a1[i]+k)%10;

k=(a1[i]+k)/10;

}

if(k!=0)

{

c[l1]=k;

len=l1+1;

}

else l