Lines Matching refs:RSA_LIMBS
38 limbsh = RSA_LIMBS - 1;
44 while (!(tmp[RSA_LIMBS] & 0x80000000)) {
45 for (i = RSA_LIMBS; i > 0; i--) {
59 for (i = RSA_LIMBS; i >= 0; i--) {
68 for (i = 0; i <= RSA_LIMBS; i++) {
76 for (i = RSA_LIMBS + limbsh + 1; i < RSA_LIMBS * 2; i++) {
96 for (i = 0; i < RSA_LIMBS; i++) {
112 static void biMulIterative(uint32_t *ret, const uint32_t *a, const uint32_t *b, uint32_t step) //ret = a * b, call with step = [0..RSA_LIMBS)
123 for (j = 0; j < RSA_LIMBS; j++) {
130 for (j = step + RSA_LIMBS; j < RSA_LIMBS * 2; j++) {
142 * we break up each mul and mod itself into more steps. mul needs RSA_LIMBS steps, and mod needs up to RSA_LEN * 2 + 2 steps
187 if (gigastepSubstep == RSA_LIMBS - 1) //MUL is done - do mod next
240 for (step = 0; step < RSA_LIMBS; step++)
