第二周作业——RSA算法

public static int isPrime(long a){for(int i=2;i<=Math.sqrt(a);i++){if(a%i==0)return 0;}return 1;}static long l=1;public static long createRndlnteger(int n){if(n>2){createRndlnteger(n-1);}int ii = (int)(Math.random()*2);l = ii+l*2;return l;}public static long createRndPrime(int n){long ll=createRndlnteger(n);while(isPrime(ll)==0){l=1;ll=createRndlnteger(n);}return ll;}