Primes Class Reference

Prime number creation class. More...

List of all members.

Static Public Member Functions
static BigInteger	createProbablePrime (int bitLength, int certainty, const int *randomSeeds=0, int numRandomSeeds=0)
	Creates a random prime number with a given bit-length.
static bool	isProbablyPrime (const BigInteger &number, int certainty)
	Tests a number to see if it's prime.

---

Detailed Description

Prime number creation class.

This class contains static methods for generating and testing prime numbers.

See also:

BigInteger

---

Member Function Documentation

static BigInteger Primes::createProbablePrime	(	int	bitLength,
		int	certainty,
		const int *	randomSeeds = 0,
		int	numRandomSeeds = 0
	)		[static]

Creates a random prime number with a given bit-length.

The certainty parameter specifies how many iterations to use when testing for primality. A safe value might be anything over about 20-30.

The randomSeeds parameter lets you optionally pass it a set of values with which to seed the random number generation, improving the security of the keys generated.

static bool Primes::isProbablyPrime	(	const BigInteger &	number,
		int	certainty
	)		[static]

Tests a number to see if it's prime.

This isn't a bulletproof test, it uses a Miller-Rabin test to determine whether the number is prime.

The certainty parameter specifies how many iterations to use when testing - a safe value might be anything over about 20-30.

---

The documentation for this class was generated from the following file:

• juce_Primes.h