You can, and that is Toom-Cook: cut each number into k parts, evaluate at 2k - 1 points, multiply there, then interpolate back, for an exponent of log_k(2k - 1). That is 1.585 for k = 2, 1.465 for k = 3, 1.404 for k = 4, and it approaches 1 as k grows. The catch is the interpolation, whose additions, shifts and small divisions grow quickly with k, so each k only wins over a window of operand sizes. That is why a serious bignum library does not pick one k, it switches between them as the operands grow.