Random primes in arithmetic progressions
Computational Complexity
2022-05-02 v2 Symbolic Computation
Number Theory
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.
Cite
@article{arxiv.2202.05955,
title = {Random primes in arithmetic progressions},
author = {Pascal Giorgi and Bruno Grenet and Armelle Perret du Cray and Daniel S. Roche},
journal= {arXiv preprint arXiv:2202.05955},
year = {2022}
}