fn a_lte_c<L: Limbs>(a: &mut L, b_sign: &mut Choice, c: &mut L)
Obtain the equivalent form (a', b', c') for which a' <= c'.
(a', b', c')
a' <= c'
This assumes c has at least as many limbs as a.
c
a
This corresponds to step 2 of Algorithm 1.