C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random ran

The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, define recursively as follows. It y is equal to 0, then gcd(x

1．问题描述 RSA密码系统可具体描述为：取两个大素数p和q，令n=pq,N=(p-1)(q-1),随机选择整数d,满足gcd(d,N)=1,ed=1 modN。 公开密钥：k1=(n,e) 私有密钥：k2=(p,q,d) 加密算法：对于待加密消息m，其对应的密文为c=E(m)=me(modn) 解密算法：D(c)=cd(modn) 2．基本要求 p,q,d,e参数选取合理，程序要求界面友好，自动化程度高。 4． 实现提示 要实现一个真实的RSA密码系统，主要考虑对大整数的处理。P