libtommath/bn_mp_read_unsigned_bin.c

54 lines
1.3 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_READ_UNSIGNED_BIN_C
2003-02-28 16:08:34 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 16:08:34 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-02-28 16:08:34 +00: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.
*/
/* reads a unsigned char array, assumes the msb is stored first [big endian] */
2017-08-30 17:07:12 +00:00
int mp_read_unsigned_bin(mp_int *a, const unsigned char *b, int c)
2003-02-28 16:08:34 +00:00
{
2017-08-30 17:13:53 +00:00
int res;
2003-08-29 14:06:56 +00:00
2017-08-30 17:13:53 +00:00
/* make sure there are at least two digits */
if (a->alloc < 2) {
if ((res = mp_grow(a, 2)) != MP_OKAY) {
return res;
}
}
2003-08-29 14:06:56 +00:00
2017-08-30 17:13:53 +00:00
/* zero the int */
mp_zero(a);
2003-08-29 14:06:56 +00:00
2017-08-30 17:13:53 +00:00
/* read the bytes in */
while (c-- > 0) {
if ((res = mp_mul_2d(a, 8, a)) != MP_OKAY) {
return res;
}
2003-02-28 16:08:34 +00:00
2003-07-12 14:31:43 +00:00
#ifndef MP_8BIT
2017-08-30 17:13:53 +00:00
a->dp[0] |= *b++;
a->used += 1;
2003-07-12 14:31:43 +00:00
#else
2017-08-30 17:13:53 +00:00
a->dp[0] = (*b & MP_MASK);
2017-10-15 17:57:12 +00:00
a->dp[1] |= ((*b++ >> 7) & 1u);
2017-08-30 17:13:53 +00:00
a->used += 2;
2003-07-12 14:31:43 +00:00
#endif
2017-08-30 17:13:53 +00:00
}
mp_clamp(a);
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
2017-08-28 14:27:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */