Expand description

Multiplication of Naturals.

Modules

Code for the Schönhage-Strassen (FFT) multiplication algorithm.

Code for multiplying a many-limbed Natural by a single limb.

Code for computing only the lowest limbs of the product of two Naturals.

Code for multiplying two Naturals modulo one less than a large power of 2; used by the Schönhage-Strassen algorithm.

Code for evaluating polynomials at various points; used in Toom-Cook multiplication.

Code for reconstructing polynomials from their values at various points; used in Toom-Cook multiplication.

Code for computing only the lowest limbs of the square of a Natural.

Code for Toom-Cook multiplication.