Lines Matching defs:mod
297 BN_ULONG mod = BN_mod_word(w, primes[i]);
298 if (mod == (BN_ULONG)-1)
300 if (mod == 0)
379 /* Montgomery setup for computations mod a */
405 /* (Step 4.5) z = b^m mod w */
413 /* (Step 4.7.1 - 4.7.2) x = z. z = x^2 mod w */
423 /* At this point z = b^((w-1)/2) mod w */
424 /* (Steps 4.8 - 4.9) x = z, z = x^2 mod w */
430 /* (Step 4.11) x = b^(w-1) mod w */
494 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
495 if (mod == (BN_ULONG)-1)
497 mods[i] = (prime_t) mod;
579 BN_ULONG mod = BN_mod_word(rnd, (BN_ULONG)primes[i]);
580 if (mod == (BN_ULONG)-1)
582 mods[i] = (prime_t) mod;
591 /* rnd mod p == 1 implies q = (rnd-1)/2 is divisible by p */