Lines Matching full:prime
34 * that is, where q = (p-1)/2 is also prime.
74 * Prime sieving defines
98 * Constant: when used with 32-bit integers, the largest sieve prime
118 * Prime testing defines
256 * Set power to the length in bits of the prime to be generated.
257 * This is changed to 1 less than the desired safe prime moduli p.
272 * guaranteed) of catching at least one safe prime.
347 /* The next tiny prime */
358 * Start the small block search at the next possible prime. To avoid
368 /* The next tiny prime */
399 /* The next small prime */
540 debug2("Unknown prime type");
601 * really verifying that q is prime until after we know
602 * that p is also prime. A single pass will weed out the
606 debug("%10u: q failed first possible prime test",
612 * q is possibly prime, so go ahead and really make sure
613 * that p is prime. If it is, then we can go back and do
619 debug("%10u: p is not prime", count_in);
622 debug("%10u: p is almost certainly prime", count_in);
626 debug("%10u: q is not prime", count_in);
629 prime", count_in);
