Rapid multiplication modulo the sum and difference of highly composite numbers

We extend the work of Richard Crandall et al. to demonstrate how the Discrete Weighted Transform (DWT) can be applied to speed up multiplication modulo any number of the form a ± b where Πp|abP is small. In particular this allows rapid computation modulo numbers of the form k.2n ± 1.In addition, we prove tight bounds on the rounding errors which naturally occur in floating-point implementations of FFT and DWT multiplications. This makes it possible for FFT multiplications to be used in situations where correctness is essential, for example in computer algebra packages.