Lines Matching full:tmpa
154 * biMul(state->tmpA, state->tmpB, state->tmpB);
155 * biMod(state->tmpA, c, state->tmpB);
156 * memcpy(state->tmpB, state->tmpA, RSA_BYTES);
159 * //calculate a ^ 65537 mod c into state->tmpA [ at this point this means do state->tmpA = (state->tmpB * a) % c ]
160 * biMul(state->tmpA, state->tmpB, a);
161 * biMod(state->tmpA, c, state->tmpB);
164 * return state->tmpA;
186 biMulIterative(state->tmpA, state->tmpB, gigastep == 16 ? a : state->tmpB, gigastepSubstep);
193 if (biModIterative(state->tmpA, c, state->tmpB, state1, state2, gigastepSubstep - RSA_LEN)) { //MOD is done
203 memcpy(state->tmpB, state->tmpA, RSA_BYTES);
209 return state->tmpA;
250 memset(state->tmpA, 0, RSA_BYTES * 2); //tA will hold result
251 state->tmpA[0] = 1;
256 memcpy(state->tmpB, state->tmpA, RSA_BYTES);
257 biMul(state->tmpA, state->tmpB, state->tmpC);
258 biMod(state->tmpA, c, state->tmpB);
263 memcpy(state->tmpB, state->tmpA, RSA_BYTES); //save tA
264 biMul(state->tmpA, state->tmpC, state->tmpC);
265 biMod(state->tmpA, c, state->tmpC);
266 memcpy(state->tmpC, state->tmpA, RSA_BYTES);
267 memcpy(state->tmpA, state->tmpB, RSA_BYTES); //restore tA
275 return state->tmpA;
