public class RandomGenerator
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
static RandomGeneratorImpl |
impl
If you want to exchange the implementation used to generate randomness in this library,
change the value of this variable.
|
| Modifier and Type | Method and Description |
|---|---|
static boolean |
getRandomBit() |
static byte[] |
getRandomBytes(int l)
Returns random byte array of given length.
|
static java.math.BigInteger |
getRandomNonZeroNumber(java.math.BigInteger exclusiveUpperBound)
Generates a uniformly random integer k with
1 <= k < exclusiveUpperBound |
static java.math.BigInteger |
getRandomNumber(java.math.BigInteger exclusiveUpperBound)
Generates a uniformly random integer k with
0 <= k < exclusiveUpperBound |
static java.math.BigInteger |
getRandomNumber(java.math.BigInteger inclusiveLowerBound,
java.math.BigInteger exclusiveUpperBound)
Generates a uniformly random integer k with
inclusiveLowerBound <= k < exclusiveUpperBound |
static int |
getRandomNumber(int exclusiveUpperBound)
Generates a uniformly random integer k with
0 <= k < exclusiveUpperBound |
static int |
getRandomNumber(int inclusiveLowerBound,
int exclusiveUpperBound)
Generates a uniformly random integer k with
inclusiveLowerBound <= k < exclusiveUpperBound. |
static long |
getRandomNumber(long exclusiveUpperBound)
Generates a uniformly random integer k with
0 <= k < exclusiveUpperBound |
static long |
getRandomNumber(long inclusiveLowerBound,
long exclusiveUpperBound)
Generates a uniformly random integer k with
inclusiveLowerBound <= k < exclusiveUpperBound. |
static java.math.BigInteger |
getRandomNumberOfBitlength(int bitlength)
Generates a random integer k with \(0 \leq k < 2^{\text{bitlength}}-1\).
|
static java.math.BigInteger |
getRandomPrime(int bitlength)
Generates a random prime number from the interval \([2^{n-1}, 2^n-1]\).
|
public static RandomGeneratorImpl impl
public static java.math.BigInteger getRandomNumber(java.math.BigInteger exclusiveUpperBound)
0 <= k < exclusiveUpperBoundpublic static long getRandomNumber(long exclusiveUpperBound)
0 <= k < exclusiveUpperBoundpublic static int getRandomNumber(int exclusiveUpperBound)
0 <= k < exclusiveUpperBoundpublic static java.math.BigInteger getRandomNumber(java.math.BigInteger inclusiveLowerBound,
java.math.BigInteger exclusiveUpperBound)
inclusiveLowerBound <= k < exclusiveUpperBoundpublic static long getRandomNumber(long inclusiveLowerBound,
long exclusiveUpperBound)
inclusiveLowerBound <= k < exclusiveUpperBound.public static int getRandomNumber(int inclusiveLowerBound,
int exclusiveUpperBound)
inclusiveLowerBound <= k < exclusiveUpperBound.public static java.math.BigInteger getRandomNonZeroNumber(java.math.BigInteger exclusiveUpperBound)
1 <= k < exclusiveUpperBoundpublic static java.math.BigInteger getRandomNumberOfBitlength(int bitlength)
public static byte[] getRandomBytes(int l)
l - length of resulting byte arraypublic static boolean getRandomBit()
public static java.math.BigInteger getRandomPrime(int bitlength)
bitlength - desired number of bits for the prime numberBigInteger that is probably prime