2018-05-02 15:43:17 -04:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 18:07:18 -04:00
|
|
|
#ifdef BN_MP_READ_SIGNED_BIN_C
|
2003-02-28 11:08:34 -05:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
2003-08-04 21:24:44 -04:00
|
|
|
* LibTomMath is a library that provides multiple-precision
|
2003-02-28 11:08:34 -05:00
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
2003-08-04 21:24:44 -04:00
|
|
|
* The library was designed directly after the MPI library by
|
2003-02-28 11:08:34 -05:00
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
|
|
|
* The library is free for all purposes without any express
|
|
|
|
* guarantee it works.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* read signed bin, big endian, first byte is 0==positive or 1==negative */
|
2017-08-30 13:07:12 -04:00
|
|
|
int mp_read_signed_bin(mp_int *a, const unsigned char *b, int c)
|
2003-02-28 11:08:34 -05:00
|
|
|
{
|
2017-08-30 13:13:53 -04:00
|
|
|
int res;
|
2003-02-28 11:08:34 -05:00
|
|
|
|
2017-08-30 13:13:53 -04:00
|
|
|
/* read magnitude */
|
|
|
|
if ((res = mp_read_unsigned_bin(a, b + 1, c - 1)) != MP_OKAY) {
|
|
|
|
return res;
|
|
|
|
}
|
2003-08-29 10:06:56 -04:00
|
|
|
|
2017-08-30 13:13:53 -04:00
|
|
|
/* first byte is 0 for positive, non-zero for negative */
|
2017-10-15 13:58:35 -04:00
|
|
|
if (b[0] == (unsigned char)0) {
|
2017-08-30 13:13:53 -04:00
|
|
|
a->sign = MP_ZPOS;
|
|
|
|
} else {
|
|
|
|
a->sign = MP_NEG;
|
|
|
|
}
|
2003-08-29 10:06:56 -04:00
|
|
|
|
2017-08-30 13:13:53 -04:00
|
|
|
return MP_OKAY;
|
2003-02-28 11:08:34 -05:00
|
|
|
}
|
2004-10-29 18:07:18 -04:00
|
|
|
#endif
|
2005-08-01 12:37:28 -04:00
|
|
|
|
2017-08-28 10:27:26 -04:00
|
|
|
/* ref: $Format:%D$ */
|
|
|
|
/* git commit: $Format:%H$ */
|
|
|
|
/* commit time: $Format:%ai$ */
|