Mercurial > dropbear
comparison bn_mp_prime_miller_rabin.c @ 142:d29b64170cf0 libtommath-orig
import of libtommath 0.32
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Sun, 19 Dec 2004 11:33:56 +0000 |
parents | 86e0b50a9b58 |
children | d8254fc979e9 |
comparison
equal
deleted
inserted
replaced
19:e1037a1e12e7 | 142:d29b64170cf0 |
---|---|
1 #include <tommath.h> | |
2 #ifdef BN_MP_PRIME_MILLER_RABIN_C | |
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis | 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis |
2 * | 4 * |
3 * LibTomMath is a library that provides multiple-precision | 5 * LibTomMath is a library that provides multiple-precision |
4 * integer arithmetic as well as number theoretic functionality. | 6 * integer arithmetic as well as number theoretic functionality. |
5 * | 7 * |
10 * The library is free for all purposes without any express | 12 * The library is free for all purposes without any express |
11 * guarantee it works. | 13 * guarantee it works. |
12 * | 14 * |
13 * Tom St Denis, [email protected], http://math.libtomcrypt.org | 15 * Tom St Denis, [email protected], http://math.libtomcrypt.org |
14 */ | 16 */ |
15 #include <tommath.h> | |
16 | 17 |
17 /* Miller-Rabin test of "a" to the base of "b" as described in | 18 /* Miller-Rabin test of "a" to the base of "b" as described in |
18 * HAC pp. 139 Algorithm 4.24 | 19 * HAC pp. 139 Algorithm 4.24 |
19 * | 20 * |
20 * Sets result to 0 if definitely composite or 1 if probably prime. | 21 * Sets result to 0 if definitely composite or 1 if probably prime. |
93 __Y:mp_clear (&y); | 94 __Y:mp_clear (&y); |
94 __R:mp_clear (&r); | 95 __R:mp_clear (&r); |
95 __N1:mp_clear (&n1); | 96 __N1:mp_clear (&n1); |
96 return err; | 97 return err; |
97 } | 98 } |
99 #endif |