4
* Utilities for finding and working with prime and pseudo-prime
7
* ***** BEGIN LICENSE BLOCK *****
8
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
10
* The contents of this file are subject to the Mozilla Public License Version
11
* 1.1 (the "License"); you may not use this file except in compliance with
12
* the License. You may obtain a copy of the License at
13
* http://www.mozilla.org/MPL/
15
* Software distributed under the License is distributed on an "AS IS" basis,
16
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
17
* for the specific language governing rights and limitations under the
20
* The Original Code is the MPI Arbitrary Precision Integer Arithmetic library.
22
* The Initial Developer of the Original Code is
23
* Michael J. Fromberger.
24
* Portions created by the Initial Developer are Copyright (C) 1997
25
* the Initial Developer. All Rights Reserved.
29
* Alternatively, the contents of this file may be used under the terms of
30
* either the GNU General Public License Version 2 or later (the "GPL"), or
31
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
32
* in which case the provisions of the GPL or the LGPL are applicable instead
33
* of those above. If you wish to allow use of your version of this file only
34
* under the terms of either the GPL or the LGPL, and not to allow others to
35
* use your version of this file under the terms of the MPL, indicate your
36
* decision by deleting the provisions above and replace them with the notice
37
* and other provisions required by the GPL or the LGPL. If you do not delete
38
* the provisions above, a recipient may use your version of this file under
39
* the terms of any one of the MPL, the GPL or the LGPL.
41
* ***** END LICENSE BLOCK ***** */
48
extern const int prime_tab_size; /* number of primes available */
49
extern const mp_digit prime_tab[];
51
/* Tests for divisibility */
52
mp_err mpp_divis(mp_int *a, mp_int *b);
53
mp_err mpp_divis_d(mp_int *a, mp_digit d);
55
/* Random selection */
56
mp_err mpp_random(mp_int *a);
57
mp_err mpp_random_size(mp_int *a, mp_size prec);
59
/* Pseudo-primality testing */
60
mp_err mpp_divis_vector(mp_int *a, const mp_digit *vec, int size, int *which);
61
mp_err mpp_divis_primes(mp_int *a, mp_digit *np);
62
mp_err mpp_fermat(mp_int *a, mp_digit w);
63
mp_err mpp_fermat_list(mp_int *a, const mp_digit *primes, mp_size nPrimes);
64
mp_err mpp_pprime(mp_int *a, int nt);
65
mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes,
66
unsigned char *sieve, mp_size nSieve);
67
mp_err mpp_make_prime(mp_int *start, mp_size nBits, mp_size strong,
68
unsigned long * nTries);
70
#endif /* end _H_MP_PRIME_ */