Faster truncated integer multiplication

Abstract

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