Home | History | Annotate | Download | only in libtommath

Lines Matching refs:primes

1521 primes are acceptable.  
1594 This will attempt to evenly divide $a$ by a list of primes\footnote{Default is the first 256 primes.} and store the
1595 outcome in ``result''. That is if $result = 0$ then $a$ is not divisible by the primes, otherwise it is. Note that
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).
1652 \section{Random Primes}
1667 mp\_prime\_random() is more suitable for generating primes which must be secret (as in the case of RSA) since there