package org.bouncycastle.crypto.generators;

import java.math.BigInteger;
import java.security.SecureRandom;

import org.bouncycastle.crypto.params.DHParameters;
import org.bouncycastle.util.BigIntegers;

public class DHParametersGenerator
{
    private int             size;
    private int             certainty;
    private SecureRandom    random;

    /**
     * Initialise the parameters generator.
     * 
     * @param size bit length for the prime p
     * @param certainty level of certainty for the prime number tests
     * @param random  a source of randomness
     */
    public void init(
        int             size,
        int             certainty,
        SecureRandom    random)
    {
        this.size = size;
        this.certainty = certainty;
        this.random = random;
    }

    /**
     * which generates the p and g values from the given parameters,
     * returning the DHParameters object.
     * <p>
     * Note: can take a while...
     * @return a generated Diffie-Hellman parameters object.
     */
    public DHParameters generateParameters()
    {
        //
        // find a safe prime p where p = 2*q + 1, where p and q are prime.
        //
//        BigInteger[] safePrimes = DHParametersHelper.generateSafePrimes(size, certainty, random, false);
//
//        BigInteger p = safePrimes[0];
//        BigInteger q = safePrimes[1];
//        BigInteger g = DHParametersHelper.selectGenerator(p, q, random);

        // Generate a safe prime p (p == 2.q + 1) for which 2 has order q
        BigInteger[] safePrimes = DHParametersHelper.generateSafePrimes(size, certainty, random, true);
        BigInteger p = safePrimes[0];
        BigInteger q = safePrimes[1];

//        assert (p.intValue() & 7) == 7;
        BigInteger g = BigIntegers.TWO;

        return new DHParameters(p, g, q, BigIntegers.TWO, null);
    }
}
