Lines Matching refs:prime
61 BN_generate_prime_ex2() generates a pseudo-random prime number of
65 The returned number is probably prime with a negligible error.
67 It's 2^-287 for a 512 bit prime, 2^-435 for a 1024 bit prime,
68 2^-648 for a 2048 bit prime, and lower than 2^-882 for primes larger
71 If B<add> is B<NULL> the returned prime number will have exact bit
83 potential prime number.
92 When a prime has been found, B<BN_GENCB_call(cb, 2, i)> is called.
101 The prime may have to fulfill additional requirements for use in
104 If B<add> is not B<NULL>, the prime will fulfill the condition p % B<add>
108 If B<safe> is true, it will be a safe prime (i.e. a prime p so
109 that (p-1)/2 is also prime). If B<safe> is true, and B<rem> == B<NULL>
125 and BN_is_prime_fasttest() test if the number B<p> is prime.
128 If B<p> passes all these tests, it is considered a probable prime.
197 1 if it is prime with an error probability of less than 0.25^B<nchecks>, and
200 BN_generate_prime() returns the prime number on success, B<NULL> otherwise.