算术级数中的随机素数
Random primes in arithmetic progressions
摘要：
我们描述了一个简单的方法来生成一个随机素数q，使得乘法群GF（q）* 也有一个随机大素数阶子群。所描述的算法也产生了这个阶p以及第p个原单位根。这里的方法是有效的渐近，但由于大常数可能不是很有用的实际设置。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
