Integer multiplication is at least as hard as matrix transposition

Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an $n \times n$ binary matrix requires $\Omega\left(n^{2} \log n\right)$ steps on a Turing machine, then our reduction implies that multiplying n-bit integers requires $\Omega(n \log n)$ steps. In other words, if matrix transposition is as hard as expected, then integer multiplication is also as hard as expected. Index Terms-matrix transposition, integer multiplication, lower bounds