something
different for the final quotient limb).
For side-channel silent division, we'd need to store away the q limbs
and add them up in a single loop after the main loop. The carry from
addmul_1 would have to be handled inside the loop, not sure how to best do
that.
For general schoolbook division
) and u is a different number of n+m
limbs?
OK, I think I see what you're doing. You're allowing some greater
partial remainders, and will then (typically) generate a limb+bit
quotient.
This is highly interesting.
For side-channel silent division, we'd need to store away the q limbs
and add them
