On modular inverses of cyclotomic polynomials and the magnitude of their coefficients
Clément Dunand · LMS Journal of Computation and Mathematics · 2012
Abstract Let 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.