# algorithms – What’s the average number of transistor switches needed to do an N-bit x N-bit multiply?

I want to know how switch-efficient a multiplier can be. If I need to do many $$N$$-bit by $$N$$-bit multiplies, and each bit is determined by flipping a coin, what’s the average number of transistor switches that will be required per multiply, in terms of $$N$$?