Random primes in arithmetic progressions
Abstract
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large primeorder 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.
 Publication:

arXiv eprints
 Pub Date:
 February 2022
 DOI:
 10.48550/arXiv.2202.05955
 arXiv:
 arXiv:2202.05955
 Bibcode:
 2022arXiv220205955G
 Keywords:

 Computer Science  Computational Complexity;
 Computer Science  Symbolic Computation;
 Mathematics  Number Theory