Logo image
Se connecter
Random primes in arithmetic progressions
Prépublication

Random primes in arithmetic progressions

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray et Daniel S Roche
11/02/2022

Résumé

Computer Science - Computational Complexity Computer Science - Symbolic Computation Mathematics - Number Theory
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.

Indicateurs

1 Consultations de la notice

Détails

Logo image