tommath/bn_mp_prime_is_prime.c

84 lines
1.8 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_PRIME_IS_PRIME_C
2003-03-22 10:10:20 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-03-22 10:10:20 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-03-22 10:10:20 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-03-22 10:10:20 -05:00
*/
/* performs a variable number of rounds of Miller-Rabin
*
* Probability of error after t rounds is no more than
2004-10-29 18:07:18 -04:00
2003-03-22 10:10:20 -05:00
*
* Sets result to 1 if probably prime, 0 otherwise
*/
2003-12-24 13:59:22 -05:00
int mp_prime_is_prime (mp_int * a, int t, int *result)
2003-03-22 10:10:20 -05:00
{
mp_int b;
int ix, err, res;
/* default to no */
2003-12-24 13:59:22 -05:00
*result = MP_NO;
2003-03-22 10:10:20 -05:00
/* valid value of t? */
2003-07-12 10:31:43 -04:00
if (t <= 0 || t > PRIME_SIZE) {
2003-03-22 10:10:20 -05:00
return MP_VAL;
}
2003-05-17 08:33:54 -04:00
/* is the input equal to one of the primes in the table? */
for (ix = 0; ix < PRIME_SIZE; ix++) {
2004-12-22 21:40:37 -05:00
if (mp_cmp_d(a, ltm_prime_tab[ix]) == MP_EQ) {
2003-05-17 08:33:54 -04:00
*result = 1;
return MP_OKAY;
}
}
2003-03-22 10:10:20 -05:00
/* first perform trial division */
if ((err = mp_prime_is_divisible (a, &res)) != MP_OKAY) {
return err;
}
2003-07-12 10:31:43 -04:00
/* return if it was trivially divisible */
2003-12-24 13:59:22 -05:00
if (res == MP_YES) {
2003-03-22 10:10:20 -05:00
return MP_OKAY;
}
/* now perform the miller-rabin rounds */
if ((err = mp_init (&b)) != MP_OKAY) {
return err;
}
for (ix = 0; ix < t; ix++) {
/* set the prime */
2004-12-22 21:40:37 -05:00
mp_set (&b, ltm_prime_tab[ix]);
2003-03-22 10:10:20 -05:00
if ((err = mp_prime_miller_rabin (a, &b, &res)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_B;
2003-03-22 10:10:20 -05:00
}
2003-12-24 13:59:22 -05:00
if (res == MP_NO) {
2004-12-22 21:40:37 -05:00
goto LBL_B;
2003-03-22 10:10:20 -05:00
}
}
/* passed the test */
2003-12-24 13:59:22 -05:00
*result = MP_YES;
2004-12-22 21:40:37 -05:00
LBL_B:mp_clear (&b);
2003-03-22 10:10:20 -05:00
return err;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */