Mercurial > dropbear
comparison libtommath/bn_mp_prime_is_prime.c @ 1436:60fc6476e044
Update to libtommath v1.0
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Sat, 24 Jun 2017 22:37:14 +0800 |
parents | 5ff8218bcee9 |
children | 8bba51a55704 |
comparison
equal
deleted
inserted
replaced
1435:f849a5ca2efc | 1436:60fc6476e044 |
---|---|
1 #include <tommath.h> | 1 #include <tommath_private.h> |
2 #ifdef BN_MP_PRIME_IS_PRIME_C | 2 #ifdef BN_MP_PRIME_IS_PRIME_C |
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis | 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis |
4 * | 4 * |
5 * LibTomMath is a library that provides multiple-precision | 5 * LibTomMath is a library that provides multiple-precision |
6 * integer arithmetic as well as number theoretic functionality. | 6 * integer arithmetic as well as number theoretic functionality. |
10 * additional optimizations in place. | 10 * additional optimizations in place. |
11 * | 11 * |
12 * The library is free for all purposes without any express | 12 * The library is free for all purposes without any express |
13 * guarantee it works. | 13 * guarantee it works. |
14 * | 14 * |
15 * Tom St Denis, [email protected], http://math.libtomcrypt.com | 15 * Tom St Denis, [email protected], http://libtom.org |
16 */ | 16 */ |
17 | 17 |
18 /* performs a variable number of rounds of Miller-Rabin | 18 /* performs a variable number of rounds of Miller-Rabin |
19 * | 19 * |
20 * Probability of error after t rounds is no more than | 20 * Probability of error after t rounds is no more than |
29 | 29 |
30 /* default to no */ | 30 /* default to no */ |
31 *result = MP_NO; | 31 *result = MP_NO; |
32 | 32 |
33 /* valid value of t? */ | 33 /* valid value of t? */ |
34 if (t <= 0 || t > PRIME_SIZE) { | 34 if ((t <= 0) || (t > PRIME_SIZE)) { |
35 return MP_VAL; | 35 return MP_VAL; |
36 } | 36 } |
37 | 37 |
38 /* is the input equal to one of the primes in the table? */ | 38 /* is the input equal to one of the primes in the table? */ |
39 for (ix = 0; ix < PRIME_SIZE; ix++) { | 39 for (ix = 0; ix < PRIME_SIZE; ix++) { |
76 LBL_B:mp_clear (&b); | 76 LBL_B:mp_clear (&b); |
77 return err; | 77 return err; |
78 } | 78 } |
79 #endif | 79 #endif |
80 | 80 |
81 /* $Source: /cvs/libtom/libtommath/bn_mp_prime_is_prime.c,v $ */ | 81 /* $Source$ */ |
82 /* $Revision: 1.3 $ */ | 82 /* $Revision$ */ |
83 /* $Date: 2006/03/31 14:18:44 $ */ | 83 /* $Date$ */ |