Faster truncated integer multiplication

03/02/2017

∙

by   David Harvey, et al.

∙

0

∙

share

We present new algorithms for computing the low n bits or the high n bits of the product of two n-bit integers. We show that these problems may be solved in asymptotically 75 assuming that the underlying integer multiplication algorithm relies on computing cyclic convolutions of real sequences.