Lines Matching full:prime
3953 /* Check for other prime modules, note it's not an ERROR but we must
4003 /* computes the jacobi c = (a | n) (or Legendre if n is prime)
5541 * If "a" were prime then b**a == b (mod a) since the order of
5664 * Sets result to 1 if probably prime, 0 otherwise
5703 /* set the prime */
5749 * Sets result to 0 if definitely composite or 1 if probably prime.
5820 /* probably prime now */
5853 /* finds the next prime after the number "a" using "t" trials
5856 * bbs_style = 1 means the prime must be congruent to 3 mod 4
5872 /* simple algo if a is less than the largest prime in the table */
5874 /* find which prime it is bigger than */
5878 /* ok we found a prime smaller or
5881 * however, the prime must be
5885 /* scan upwards for a prime congruent to 3 mod 4 */
5907 /* generate a prime congruent to 3 mod 4 or 1/3 mod 4? */
5946 /* y == 1 if any residue was zero [e.g. cannot be prime] */
5979 /* is this prime? */
6083 /* makes a truly random prime of a given size (bits),
6087 * LTM_PRIME_BBS - make prime congruent to 3 mod 4
6088 * LTM_PRIME_SAFE - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS)
6098 /* This is possibly the mother of all prime generation functions, muahahahahaha! */
6157 /* is it prime? */
6164 /* see if (a-1)/2 is prime */
6168 /* is it prime? */
