Abstract
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.
Subject
Computational Theory and Mathematics,General Mathematics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献