Mercurial > dropbear

comparison bn_mp_prime_next_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_NEXT_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 /* finds the next prime after the number "a" using "t" trials 18 /* finds the next prime after the number "a" using "t" trials
18 * of Miller-Rabin. 19 * of Miller-Rabin.
19 * 20 *
20 * bbs_style = 1 means the prime must be congruent to 3 mod 4 21 * bbs_style = 1 means the prime must be congruent to 3 mod 4
160 __ERR: 161 __ERR:
161 mp_clear(&b); 162 mp_clear(&b);
162 return err; 163 return err;
163 } 164 }
164 165
166 #endif