Kronecker's trick

Hello,
Does anyone know of a proof for Kronecker's trick? As far as I know,
it's a way of multiplying 2 polynomials using integer operations. I
found about this concept on a paper by R. Fateman
[http://www.cs.berkeley.edu/~fateman/papers/polysbyGMP.pdf] and I see
how it works but I can't prove to myself that it gives us the correct
answer.

Any help or pointer to references would be appreciated.

Cheers,
didier

.

Relevant Pages

  • Multiplication trick in GF(2^m)
    ... I present a trick to perform efficiently the operation ... these polynomials have maximum degree /2. ... The method applies only to this kind of trinomial primitives with "m" ... uses to be prime and you can choose in most cases "n" as odd. ...
    (sci.crypt)
  • Re: coefficients
    ... the other sums) ... multiply the first two polynomials, ... Multiplying ... The coefficient of x^15 is therefore 28. ...
    (sci.math)
  • Re: convolution + basic image processing question
    ... I didn't know anything about convolution before, ... Don't try to convert this analogy to ... you were multiplying polynomials in this manner. ...
    (comp.soft-sys.matlab)
  • Re: Fast exponent and logarithm, given initial estimate
    ... > do this by multiplying X by log_2 ... The Altivec exp estimate can calculate ... rounding errors when I used squaring reduction and Taylor polynomials ...
    (sci.math.num-analysis)
  • Re: Make the denominator rational
    ... But by Newton's theorem these polynomials ... can be expressed as integral polynomials in the ... Then multiplying top and bottom by b^2 - c^2 ...
    (sci.math)