Random primes in arithmetic progressions
From MaRDI portal
Abstract: 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.
This page was built for publication: Random primes in arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6390893)
