Cryptology ePrint Archive: Report 2022/160

Random primes in arithmetic progressions

Pascal Giorgi and Bruno Grenet and Armelle Perret du Cray and Daniel S. Roche

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.

Category / Keywords: foundations / prime numbers, multiplicative subgroups

Date: received 12 Feb 2022, last revised 12 Feb 2022

Contact author: roche at usna edu

Available format(s): PDF | BibTeX Citation

Version: 20220212:065316 (All versions of this report)

Short URL: ia.cr/2022/160


[ Cryptology ePrint archive ]