1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:

/* pq[0] = p pq[1] = q mit p = 2q+1 */
BigInteger[] pq = PrimeHelper.pkq1(1000, 2, 10, new SecureRandom());
		boolean gFound = false;
		BigInteger g = null;
		while(!gFound) {
			SecureRandom sr = new SecureRandom();
			int random = sr.nextInt(pq[0].bitLength());
			BigInteger toTest = new BigInteger(random, new SecureRandom());
			BigInteger is1 = toTest.modPow(pq[1], pq[0]);
			if(is1.equals(BigInteger.ONE)) {
                                g = toTest;
				gFound = true;
				System.out.println(g);
			}
		}
                .... //Generie Schluesselpaar