I want to implement partially blind signature, and I looked at Zheng Gong's scheme. (Title: Efficient Partially Blind Signature Scheme with Provable Security)
In the scheme, there is a initialization phase. Signer S selects two large prime numbers p and q (length of p = 1024, q = 160), which satisfied q|p-1. Then chosses a generator g (element of Zp), and g^q = 1 mod p.
I wonder how can I find "quickly" the two primes that satisfy the condition (q|p-1) and the generator g that satisfy g^q = 1 (mod p).