michael@0: /*
michael@0:  *  mpprime.h
michael@0:  *
michael@0:  *  Utilities for finding and working with prime and pseudo-prime
michael@0:  *  integers
michael@0:  *
michael@0:  * This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #ifndef _H_MP_PRIME_
michael@0: #define _H_MP_PRIME_
michael@0: 
michael@0: #include "mpi.h"
michael@0: 
michael@0: extern const int prime_tab_size;   /* number of primes available */
michael@0: extern const mp_digit prime_tab[];
michael@0: 
michael@0: /* Tests for divisibility    */
michael@0: mp_err  mpp_divis(mp_int *a, mp_int *b);
michael@0: mp_err  mpp_divis_d(mp_int *a, mp_digit d);
michael@0: 
michael@0: /* Random selection          */
michael@0: mp_err  mpp_random(mp_int *a);
michael@0: mp_err  mpp_random_size(mp_int *a, mp_size prec);
michael@0: 
michael@0: /* Pseudo-primality testing  */
michael@0: mp_err  mpp_divis_vector(mp_int *a, const mp_digit *vec, int size, int *which);
michael@0: mp_err  mpp_divis_primes(mp_int *a, mp_digit *np);
michael@0: mp_err  mpp_fermat(mp_int *a, mp_digit w);
michael@0: mp_err mpp_fermat_list(mp_int *a, const mp_digit *primes, mp_size nPrimes);
michael@0: mp_err  mpp_pprime(mp_int *a, int nt);
michael@0: mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes, 
michael@0: 		 unsigned char *sieve, mp_size nSieve);
michael@0: mp_err mpp_make_prime(mp_int *start, mp_size nBits, mp_size strong,
michael@0: 		      unsigned long * nTries);
michael@0: 
michael@0: #endif /* end _H_MP_PRIME_ */