mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-21 03:24:38 +02:00
66 lines
2.5 KiB
C
66 lines
2.5 KiB
C
/*
|
|
* Copyright (c) 2007, 2011, Oracle and/or its affiliates. All rights reserved.
|
|
* Use is subject to license terms.
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this library; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*/
|
|
|
|
/* *********************************************************************
|
|
*
|
|
* The Original Code is the MPI Arbitrary Precision Integer Arithmetic library.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Michael J. Fromberger.
|
|
* Portions created by the Initial Developer are Copyright (C) 1997
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
*********************************************************************** */
|
|
|
|
/* Utilities for finding and working with prime and pseudo-prime integers */
|
|
|
|
#ifndef _MP_PRIME_H
|
|
#define _MP_PRIME_H
|
|
|
|
#include "mpi.h"
|
|
|
|
extern const int prime_tab_size; /* number of primes available */
|
|
extern const mp_digit prime_tab[];
|
|
|
|
/* Tests for divisibility */
|
|
mp_err mpp_divis(mp_int *a, mp_int *b);
|
|
mp_err mpp_divis_d(mp_int *a, mp_digit d);
|
|
|
|
/* Random selection */
|
|
mp_err mpp_random(mp_int *a);
|
|
mp_err mpp_random_size(mp_int *a, mp_size prec);
|
|
|
|
/* Pseudo-primality testing */
|
|
mp_err mpp_divis_vector(mp_int *a, const mp_digit *vec, int size, int *which);
|
|
mp_err mpp_divis_primes(mp_int *a, mp_digit *np);
|
|
mp_err mpp_fermat(mp_int *a, mp_digit w);
|
|
mp_err mpp_fermat_list(mp_int *a, const mp_digit *primes, mp_size nPrimes);
|
|
mp_err mpp_pprime(mp_int *a, int nt);
|
|
mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes,
|
|
unsigned char *sieve, mp_size nSieve);
|
|
mp_err mpp_make_prime(mp_int *start, mp_size nBits, mp_size strong,
|
|
unsigned long * nTries);
|
|
|
|
#endif /* _MP_PRIME_H */
|