Implementations of integer multiplication often choose different algorithms for different input sizes: for smallest numbers the school book method is preferred, for largest sizes the method based on FFT are fastest currently known.
For medium sized inputs, what other methods there are besides the ones by Karatsuba, Toom and Cook?