Mercurial > dropbear
comparison libtommath/bn_mp_prime_is_divisible.c @ 1436:60fc6476e044
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_IS_DIVISIBLE_C | 2 #ifdef BN_MP_PRIME_IS_DIVISIBLE_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 /* determines if an integers is divisible by one | 18 /* determines if an integers is divisible by one |
19 * of the first PRIME_SIZE primes or not | 19 * of the first PRIME_SIZE primes or not |
20 * | 20 * |
43 | 43 |
44 return MP_OKAY; | 44 return MP_OKAY; |
45 } | 45 } |
46 #endif | 46 #endif |
47 | 47 |
48 /* $Source: /cvs/libtom/libtommath/bn_mp_prime_is_divisible.c,v $ */ | 48 /* $Source$ */ |
49 /* $Revision: 1.3 $ */ | 49 /* $Revision$ */ |
50 /* $Date: 2006/03/31 14:18:44 $ */ | 50 /* $Date$ */ |