密钥互换加密算法dh算法(共2页).doc

#include #include #include unsigned long pow(int x,int y)unsigned long r=1;int i;for(i=1;i=y;i+)r=r*x;return r;void main()int n,a,b,t;unsigned long x,y,k,l;printf(请输入n的值:);scanf(%d,&n);srand(time(0);a=(rand() % (n-2)+2;printf(随机数a的值:%dn,a);b=(rand() % (n-2)+2;printf(随机数b的值:%dn,b);t=(rand() % (n-2)+2;printf(随机数t的值:%dn,t);x=pow(t,a)%n;/计算t的a次幂，mod n 的值，并把结果发送给Bprintf(经计算得