On Modular Inverses of Cyclotomic Polynomials and the Magnitude of their Coefficients

Abstract

Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one. We mention an application to torus-based cryptography.

arXiv comment21 pages

References in corpus (2)

• Elliptic periods for finite fields
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials