Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Polynomial division mod n

Hi everyone,

Let's suppose that we are working with polynomials modulo n a composite number, for which we know the factorization (n=p*q). If we know that f(x) can be divided by e.g. g(x), what is the more efficient way to calculate f(x)/g(x) in Z_n with Sage?

Thanks for your time

Polynomial division mod n

Hi everyone,

Let's suppose that we are working with polynomials modulo n a composite number, for which we know the factorization (n=p*q). If we know that f(x) can be divided by e.g. g(x), what is the more most efficient way to calculate f(x)/g(x) in Z_n with Sage?

Thanks for your time