** Let
and
in
be two polynomials of degree at most
.
Let
be an upper bound for the absolute value of a coefficient
in
or
.
Then
is an upper bound for the absolute value of a coefficient
in the product
.
We assume that we have
primes numbers
such that their product
exceeds
In addition, we assume that
**
- every prime
fits in a machine word,
- computing the
mod
, for all
, can be done
machine word operations.

*Marc Moreno Maza *

2008-03-18