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.

翻译：我们描述了一种直接生成随机质q的直截了当的方法,以至于多复制组 GF(q) * 也有一个随机的大型主序分组。 描述的算法还生成了这个顺序 p 和 p'th 原始的团结根。 这里的方法是有效的, 零星的, 但是由于大常数在实际环境中可能并不十分有用 。