tommath/bn_mp_to_unsigned_bin.c

47 lines
1.2 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_TO_UNSIGNED_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.
*/
/* store in unsigned [big endian] format */
2017-09-20 10:59:43 -04:00
int mp_to_unsigned_bin(const mp_int *a, unsigned char *b)
2003-02-28 11:08:34 -05:00
{
2017-08-30 13:15:27 -04:00
int x, res;
mp_int t;
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
if ((res = mp_init_copy(&t, a)) != MP_OKAY) {
return res;
}
2003-02-28 11:08:34 -05:00
2017-08-30 13:15:27 -04:00
x = 0;
while (mp_iszero(&t) == MP_NO) {
2003-07-12 10:31:43 -04:00
#ifndef MP_8BIT
2017-10-15 13:57:12 -04:00
b[x++] = (unsigned char)(t.dp[0] & 255u);
2003-07-12 10:31:43 -04:00
#else
2017-10-15 13:57:12 -04:00
b[x++] = (unsigned char)(t.dp[0] | ((t.dp[1] & 1u) << 7));
2003-07-12 10:31:43 -04:00
#endif
2017-08-30 13:15:27 -04:00
if ((res = mp_div_2d(&t, 8, &t, NULL)) != MP_OKAY) {
mp_clear(&t);
return res;
}
}
bn_reverse(b, x);
mp_clear(&t);
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$ */