I a m trying to generate a random prime number of type BigInteger, that is between an min and max value which I supply.
I am aware of the BigInteger.probablePrime(int bitlength, random), ...
I'm aware of the function BigInteger.probablePrime(int bitLength, Random rnd) that outputs probably prime number of any bit length. I want a REAL prime number in Java. Is there any FOSS library ...
I am trying to implement either the Fermat, Miller-Rabin, or AKS algorithm in Java using the BigInteger class.
I think I have the Fermat test implemented except that the BigInteger ...