# publiclibtom/libtommath

### Subversion checkout URL

You can clone with HTTPS or Subversion.

Fetching contributors…

Cannot retrieve contributors at this time

file 68 lines (59 sloc) 1.516 kb
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 `/* LibTomMath, multiple-precision integer library -- Tom St Denis * * LibTomMath is library that provides for multiple-precision * integer arithmetic as well as number theoretic functionality. * * The library is designed directly after the MPI library by * 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, tomstdenis@iahu.ca, http://math.libtomcrypt.org */#include /* performs a variable number of rounds of Miller-Rabin * * Probability of error after t rounds is no more than * (1/4)^t when 1 <= t <= 256 * * Sets result to 1 if probably prime, 0 otherwise */intmp_prime_is_prime (mp_int * a, int t, int *result){  mp_int b;  int ix, err, res;  /* default to no */  *result = 0;  /* valid value of t? */  if (t < 1 || t > 256) {    return MP_VAL;  }  /* first perform trial division */  if ((err = mp_prime_is_divisible (a, &res)) != MP_OKAY) {    return err;  }  if (res == 1) {    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 */    mp_set (&b, __prime_tab[ix]);    if ((err = mp_prime_miller_rabin (a, &b, &res)) != MP_OKAY) {      goto __B;    }    if (res == 0) {      goto __B;    }  }  /* passed the test */  *result = 1;__B:mp_clear (&b);  return err;}`
Something went wrong with that request. Please try again.