Mercurial > dropbear

comparison bn_mp_prime_fermat.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_FERMAT_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 one Fermat test. 18 /* performs one Fermat test.
18 * 19 *
19 * If "a" were prime then b**a == b (mod a) since the order of 20 * If "a" were prime then b**a == b (mod a) since the order of
20 * the multiplicative sub-group would be phi(a) = a-1. That means 21 * the multiplicative sub-group would be phi(a) = a-1. That means
52 53
53 err = MP_OKAY; 54 err = MP_OKAY;
54 __T:mp_clear (&t); 55 __T:mp_clear (&t);
55 return err; 56 return err;
56 } 57 }
58 #endif