Split Multiplication of integers

Question

I need an algorithm that uses two 32-bit integers as parameters, and returns the multiplication of these parameters split into two other 32-bit integers: 32-highest-bits par

Answer 1

As I commented, you can treat each number as a binary string of length 32.

Just multiply these numbers using school arithmetic. You will get a 64 character long string.

Then just partition it.

If you want fast multiplication, then you can look into Karatsuba multiplication algorithm.