import java.util.HashMap;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;
/**
* @Description RSA加密解密算法
*
*/
public class Cryptology {
private final int p = 47;
private final int q = 61;
private final int e = 1223;//公钥
//快速取模指数算法
public int mod(int a,int m,int n){
int c=0 , res=1;
String s=Integer.toBinaryString(m);
char[] b= s.toCharArray();
for(int j = 0;j<s.length();j++){
c=2*c;
res=(res*res)%n;
if(b[j]=='1'){
c++;
res=(res*a)%n;
}
}
return res;
}
public int euclideanAlgo(int a,int n){//拓展的欧几里德算法,用来求私钥
int X1=1,X2=0,X3=n;
int Y1=0,Y2=1,Y3=a;
int Q;
while(t