comparison libtommath/bn_mp_to_signed_bin.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_TO_SIGNED_BIN_C 2 #ifdef BN_MP_TO_SIGNED_BIN_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 /* store in signed [big endian] format */ 18 /* store in signed [big endian] format */
19 int mp_to_signed_bin (mp_int * a, unsigned char *b) 19 int mp_to_signed_bin (mp_int * a, unsigned char *b)
20 { 20 {
21 int res; 21 int res;
22 22
23 if ((res = mp_to_unsigned_bin (a, b + 1)) != MP_OKAY) { 23 if ((res = mp_to_unsigned_bin (a, b + 1)) != MP_OKAY) {
24 return res; 24 return res;
25 } 25 }
26 b[0] = (unsigned char) ((a->sign == MP_ZPOS) ? 0 : 1); 26 b[0] = (a->sign == MP_ZPOS) ? (unsigned char)0 : (unsigned char)1;
27 return MP_OKAY; 27 return MP_OKAY;
28 } 28 }
29 #endif 29 #endif
30 30
31 /* $Source: /cvs/libtom/libtommath/bn_mp_to_signed_bin.c,v $ */ 31 /* $Source$ */
32 /* $Revision: 1.3 $ */ 32 /* $Revision$ */
33 /* $Date: 2006/03/31 14:18:44 $ */ 33 /* $Date$ */