rsa.java

RSA算法实现

import java.math.BigInteger;
public class RSA extends RsaData
{
	//加密函数
	private BigInteger Encrypt(BigInteger data,long d, long n)
	{
		return pow(data,d).mod(new BigInteger(n+""));//E(x)=x.pow(e) mod n
	}
	//求一个数的n次方
	public BigInteger pow(BigInteger data,long p)
	{
		data = data.pow((int)p); 
	    return data; 
	}
	//解密函数
	public BigInteger decode(BigInteger code,long e, long n)
	{ 
    	return pow(code,e).mod(new BigInteger(n+"")); //D(y)=y.pow(d) mod n
    } 
	public static void main(String[] args)
	{
		RSA rsa = new RSA();
		BigInteger data = new BigInteger("22");//设置处置为“22”
		BigInteger code = rsa.Encrypt(data,rsa.getD(),rsa.getN());//加密
		BigInteger original_Text = rsa.decode(code,rsa.getE(),rsa.getN());//解密
		System.out.println("privateKey is: " + rsa.getD() );//解密密钥
		System.out.println("publicKey is:  " + rsa.getE());//加密密钥
		System.out.println("N is: " + rsa.getN());//公开的数n
		System.out.println("code is: " + code );//密码
		System.out.println("original Text is: " + original_Text );//原文
	}
}