## Also, 2^{p-1} == 1 (mod p), and gcd(2^{(p-1)/q_i} - 1, p) == 1 for each
## 0 <= i < 12, so p is prime by Pocklington's theorem. Finally, set q =
## q_0, and g = 2^{(p-1)/q}, so that g has order q in GF(p)^*.
## Also, 2^{p-1} == 1 (mod p), and gcd(2^{(p-1)/q_i} - 1, p) == 1 for each
## 0 <= i < 12, so p is prime by Pocklington's theorem. Finally, set q =
## q_0, and g = 2^{(p-1)/q}, so that g has order q in GF(p)^*.