a new and much harder contest

[Gandalf_Grey_]

ok heres a challenge, make a binary multuplier, out of gates, whoever can do it in the least number of logic gates wins (P.S. i have already made one mine beat another guy at my schools for fewer logic gates). here are the contest requirements

1. You must make it yourself (no google)
2. It must multuply a 2 digit binary number by a 3 digit binary number

have fun

[Gimlin]

Could you tell me how multipling binary #s workS?

[Gandalf_Grey_]

just like multuplying real number but the max is 1 instead of 10, for example

101
x11
___
101
1010
+___
1111

and and gate in binary simulates this