| D | rsa.c | 23 …32_t *num, const uint32_t *denum, uint32_t *tmp, uint32_t *state1, uint32_t *state2, uint32_t step) in biModIterative() argument
27 uint32_t bitsh = *state1, limbsh = *state2; in biModIterative()
108 *state2 = limbsh; in biModIterative()
168 …* state, const uint32_t *a, const uint32_t *c, uint32_t *state1, uint32_t *state2, uint32_t *stepP) in rsaPubOpIterative() argument
193 …if (biModIterative(state->tmpA, c, state->tmpB, state1, state2, gigastepSubstep - RSA_LEN)) { //MO… in rsaPubOpIterative()
217 uint32_t state1 = 0, state2 = 0, step = 0, ns = 0; in rsaPubOp() local
220 ret = rsaPubOpIterative(state, a, c, &state1, &state2, &step); in rsaPubOp()
231 uint32_t state1 = 0, state2 = 0, step; in biMod() local
233 for (step = 0; !biModIterative(num, denum, tmp, &state1, &state2, step); step++); in biMod()
|