choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i],...

choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in // assembly with loop unrolling depending on the architecture and bounds // checks are removed by the compiler thanks to the constant size. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i],...