AbstractLet p and r be two primes, and let
n and m be two distinct divisors of
pr. Consider Φn and Φm, the nth and mth cyclotomic
polynomials. In this paper, we present lower and upper bounds for the
coefficients of the inverse of Φn modulo Φm and discuss an application to torus-based cryptography.
We define the nth cyclotomic polynomial Φn(z) by the equationand we writewhere ϕ is Euler's function.Erdös and Vaughan [3] have shown thatuniformly in n as m-→∞, whereand that for every large m
On multiple prime divisors of cyclotomic polynomials
