Random primes in arithmetic progressions

02/12/2022
by   Pascal Giorgi, et al.
0

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of unity. The methods here are efficient asymptotically, but due to large constants may not be very useful in practical settings.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset