RSA 公钥算法Java代码(带界面).docVIP

RSA公钥加密算法代码 package .rsa.service; public class UnPrimeException extends Exception{ public UnPrimeException() { } public UnPrimeException(String message) { super(message); } public UnPrimeException(Throwable cause) { super(cause); } public UnPrimeException(String message, Throwable cause) { super(message, cause); } } ------------------------------------------------------------------------------------------------ package .rsa.service; public interface DataInfo { public MyData sendData(long p, long q, long public_key, long deprime)throws UnPrimeException; } -------------------------------------------------------------------------------------------------- package .rsa.service; public class DataDeal implements DataInfo{ @Override public MyData sendData(long p, long q, long public_key, long deprime) throws UnPrimeException { MyData data ; if (!this.primeNumber(q)||!this.primeNumber(q)){ throw new UnPrimeException(非素数，请重新输入！) ; }else if((deprime = this.getF(p,q)) || (this.gcd(this.getF(p, q),deprime)!=1)){ throw new UnPrimeException(输入的公钥不符合条件！) ; }else{ data = new MyData(p, q,public_key, deprime) ; } return data ; } //判断是否为素数 public boolean primeNumber(long t){ long k=0; k=(long)Math.sqrt((double)t); boolean flag=true; outer:for(int i=2;i=k;i++){ if((t%i)==0){ flag = false; break outer; } } return flag; } private long gcd(long a, long b){//最大公约数 long gcd; if(b==0)gcd=a; else gcd=gcd(b,a%b); return gcd; } private long getF(long p, long q){ return (p - 1)*(q -1) ; } } --------------------------------------------------------------------------------------------------------- package .rsa.service; public class MyData { private long p; private long q; private long public_key ; private long deprime ; public MyData() { super(); } public MyData(long p, long q, long public_key, long deprime) { super(); this.p = p; this.q = q; this.public_