comparison libtommath/bn_mp_invmod.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_INVMOD_C 2 #ifdef BN_MP_INVMOD_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 /* hac 14.61, pp608 */ 18 /* hac 14.61, pp608 */
19 int mp_invmod (mp_int * a, mp_int * b, mp_int * c) 19 int mp_invmod (mp_int * a, mp_int * b, mp_int * c)
20 { 20 {
21 /* b cannot be negative */ 21 /* b cannot be negative */
22 if (b->sign == MP_NEG || mp_iszero(b) == 1) { 22 if ((b->sign == MP_NEG) || (mp_iszero(b) == MP_YES)) {
23 return MP_VAL; 23 return MP_VAL;
24 } 24 }
25 25
26 #ifdef BN_FAST_MP_INVMOD_C 26 #ifdef BN_FAST_MP_INVMOD_C
27 /* if the modulus is odd we can use a faster routine instead */ 27 /* if the modulus is odd we can use a faster routine instead */
28 if (mp_isodd (b) == 1) { 28 if (mp_isodd (b) == MP_YES) {
29 return fast_mp_invmod (a, b, c); 29 return fast_mp_invmod (a, b, c);
30 } 30 }
31 #endif 31 #endif
32 32
33 #ifdef BN_MP_INVMOD_SLOW_C 33 #ifdef BN_MP_INVMOD_SLOW_C
34 return mp_invmod_slow(a, b, c); 34 return mp_invmod_slow(a, b, c);
35 #else
36 return MP_VAL;
35 #endif 37 #endif
36
37 return MP_VAL;
38 } 38 }
39 #endif 39 #endif
40 40
41 /* $Source: /cvs/libtom/libtommath/bn_mp_invmod.c,v $ */ 41 /* $Source$ */
42 /* $Revision: 1.3 $ */ 42 /* $Revision$ */
43 /* $Date: 2006/03/31 14:18:44 $ */ 43 /* $Date$ */