Mercurial > dropbear

comparison libtommath/bn_mp_prime_fermat.c @ 1436:60fc6476e044

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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_FERMAT_C 2 #ifdef BN_MP_PRIME_FERMAT_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 one Fermat test. 18 /* performs one Fermat test.
19 * 19 *
20 * 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
55 LBL_T:mp_clear (&t); 55 LBL_T:mp_clear (&t);
56 return err; 56 return err;
57 } 57 }
58 #endif 58 #endif
59 59
60 /* $Source: /cvs/libtom/libtommath/bn_mp_prime_fermat.c,v $ */ 60 /* $Source$ */
61 /* $Revision: 1.3 $ */ 61 /* $Revision$ */
62 /* $Date: 2006/03/31 14:18:44 $ */ 62 /* $Date$ */