First see pic related.

The video: "How Karatsuba's algorithm gave us new ways to multiply" made me interested in this problem.
https://www.youtube.com/watch?v=cCKOl5li6YM

Now why do we need Shonage-Strassen when the lower bound is already bit shift multiplication which is on par with addition?