java公开密钥（N，e）的生成算法

import java.util.Random;
import java.util.Scanner;

public class Rsa {
    /**
     * 2.4：公开密钥（N，e）的生成算法。关键为怎样选择一个与(p-1)(q-1)互质的数e。
     */
    public static void main(String[] args) {
        int m,n;
        long N,e;
        
        System.out.print("请输入两个素数: ");
        Scanner scan = new Scanner(System.in);
        m = scan.nextInt();
        n = scan.nextInt();
        
        N = m * n;
        e = createRndPrime(m,n);   
        System.out.print("公钥为（"+N+","+e+")");
    }
    public static long createRndPrime(int p,int q){
        
        int max,min = 0;
        max = (p-1)*(q-1) - 1;
        min = 2;

        Random num = new Random();
        long Rannum = num.nextInt(max-min+1) + min;
        
        if(isPrime(Rannum) == 1){
            return Rannum;
        } 
        return createRndPrime(p,q);
    }
    public static int isPrime(long num1){    
        for(int a = 2;a<Math.sqrt(num1);a++){
            if((Math.pow(a, num1-1) % num1)==1){
                return 1;
            }
        }
        return 0;
    }
}