Lines Matching full:prime
3616 They are all curves over the integers modulo a prime. The curves have the basic equation that is:
3706 /** The prime that defines the field (encoded in hex) */
3707 char *prime;
3967 p INTEGER , -- prime modulus
3969 -- (must be prime)
3981 p INTEGER , -- prime modulus
3983 -- (must be prime)
4033 \item $q$ a small prime of magnitude $256^{group\_size}$.
4034 \item $p = qr + 1$ a large prime of magnitude $256^{modulus\_size}$ where $r$ is a random even integer.
4044 \item $q$ must be prime.
4045 \item $p$ must be prime.
4057 ensures that the generator actually generates a prime order group. Tests seven and eight ensure that the public key
4058 is within range and belongs to a group of prime order. Note that test eight does not prove that $g$ generated $y$ only
4883 The library includes primality testing and random prime functions as well. The primality tester will perform the test in
4885 Rabin-Miller primality testing algorithm. If the candidate passes both phases it is declared prime otherwise it is declared
4886 composite. No prime number will fail the two phases but composites can. Each round of the Rabin-Miller algorithm reduces
4887 the probability of a pseudo-prime by $1 \over 4$ therefore after sixteen rounds the probability is no more than
4899 will not be able to sign or decrypt messages at all. Suppose $p$ was prime and $q$ was composite this is just a variation of
4900 the multi-prime RSA. Suppose $q = rs$ for two primes $r$ and $s$ then $\phi(pq) = (p - 1)(r - 1)(s - 1)$ which clearly is
4904 To test if a \textit{mp\_int} is prime call:
4908 This puts a one in \textit{result} if the number is probably prime, otherwise it places a zero in it. It is assumed that if
4910 a random prime call:
4917 Where \textit{len} is the size of the prime in bytes ($2 \le len \le 256$). You can set \textit{len} to the negative size you want
4918 to get a prime of the form $p \equiv 3\mbox{ }(\mbox{mod } 4)$. So if you want a 1024-bit prime of this sort pass
4920 is very likely prime.
6283 @param b The destination of the result (FP_YES if prime)
