org.cryptimeleon.math.random

Interface RandomGeneratorImpl

All Known Implementing Classes:

SecureRandomGeneratorImpl

public interface RandomGeneratorImpl

Method Summary

Modifier and Type	Method and Description
default boolean	getRandomBit()
byte[]	getRandomBytes(int l) Returns random byte array of given length.
default java.math.BigInteger	getRandomNumber(java.math.BigInteger exclusiveUpperBound) Generates a uniformly random number between 0 (inclusive) and exclusiveUpperBound (exclusive).
default java.math.BigInteger	getRandomNumber(java.math.BigInteger inclusiveLowerBound, java.math.BigInteger exclusiveUpperBound) Generates a uniformly random number between inclusiveLowerBound (inclusive) and exclusiveUpperBound (exclusive).
default java.math.BigInteger	getRandomNumberOfBitlength(int bitlength) Generates a uniformly random number between \(0\) and \(2^{\text{bitlength}}-1\) (inclusive).
default java.math.BigInteger	getRandomPrime(int bitlength) Generates a random prime number from the interval \([2^{n-1}, 2^n-1]\).

Method Detail

getRandomNumber

default java.math.BigInteger getRandomNumber(java.math.BigInteger exclusiveUpperBound)

Generates a uniformly random number between 0 (inclusive) and exclusiveUpperBound (exclusive).

getRandomNumber

default java.math.BigInteger getRandomNumber(java.math.BigInteger inclusiveLowerBound,
                                             java.math.BigInteger exclusiveUpperBound)

Generates a uniformly random number between inclusiveLowerBound (inclusive) and exclusiveUpperBound (exclusive).

getRandomNumberOfBitlength

default java.math.BigInteger getRandomNumberOfBitlength(int bitlength)

Generates a uniformly random number between \(0\) and \(2^{\text{bitlength}}-1\) (inclusive).

getRandomBytes

byte[] getRandomBytes(int l)

Returns random byte array of given length.

Parameters:

l - length of resulting byte array

getRandomBit

default boolean getRandomBit()

getRandomPrime

default java.math.BigInteger getRandomPrime(int bitlength)

Generates a random prime number from the interval \([2^{n-1}, 2^n-1]\).

Parameters:

bitlength - desired number of bits for the prime number

Returns:

a BigInteger that is probably prime