Algorithms for Relatively Cyclotomic Primes

作者：Grzeskowiak Maciej^*

来源：Fundamenta Informaticae, 2013, 125(2): 161-181.

DOI：10.3233/FI-2013-858

• primes of a special form
• computing a primitive nth root of unity modulo primes
• public key cryptography

We present a general method of generating primes p and q such that q divides Phi(n) ( p), where n %26gt; 2 is a fixed number. In particular, we present the deterministic method of finding a primitive nth roots of unity modulo q. We estimate the computational complexity of our methods.

• 出版日期2013