BigInteger X = new NativeBigInteger(1, Wbuf);
// 9: Let c = X mod 2q. Set p = X - ( c - 1 ). Therefore p mod 2q = 1.
BigInteger c = X.mod(q.add(q));
BigInteger p = X.subtract(c.subtract(BigInteger.ONE));
if(p.bitLength() >= keyLength-1) {
if(isPrime(p)) {
finish(r, hashLength, new NativeBigInteger(p), new NativeBigInteger(q), seed, counter);