Mercurial > dropbear

comparison bn_mp_prime_is_prime.c @ 142:d29b64170cf0 libtommath-orig

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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_IS_PRIME_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 /* performs a variable number of rounds of Miller-Rabin 18 /* performs a variable number of rounds of Miller-Rabin
18 * 19 *
19 * Probability of error after t rounds is no more than 20 * Probability of error after t rounds is no more than
20 * (1/4)^t when 1 <= t <= PRIME_SIZE 21
21 * 22 *
22 * Sets result to 1 if probably prime, 0 otherwise 23 * Sets result to 1 if probably prime, 0 otherwise
23 */ 24 */
24 int mp_prime_is_prime (mp_int * a, int t, int *result) 25 int mp_prime_is_prime (mp_int * a, int t, int *result)
25 { 26 {
73 /* passed the test */ 74 /* passed the test */
74 *result = MP_YES; 75 *result = MP_YES;
75 __B:mp_clear (&b); 76 __B:mp_clear (&b);
76 return err; 77 return err;
77 } 78 }
79 #endif