libtommath/mp_rand.c

47 lines
1.0 KiB
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_RAND_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
mp_err(*s_mp_rand_source)(void *out, size_t size) = s_mp_rand_platform;
void mp_rand_source(mp_err(*source)(void *out, size_t size))
{
s_mp_rand_source = (source == NULL) ? s_mp_rand_platform : source;
}
mp_err mp_rand(mp_int *a, int digits)
2003-02-28 16:08:34 +00:00
{
int i;
2019-05-19 15:16:13 +00:00
mp_err err;
2003-02-28 16:08:34 +00:00
2017-08-30 18:23:46 +00:00
mp_zero(a);
2017-08-30 18:23:46 +00:00
if (digits <= 0) {
return MP_OKAY;
}
2003-02-28 16:08:34 +00:00
2019-05-19 15:16:13 +00:00
if ((err = mp_grow(a, digits)) != MP_OKAY) {
return err;
}
2003-02-28 16:08:34 +00:00
2019-05-19 15:16:13 +00:00
if ((err = s_mp_rand_source(a->dp, (size_t)digits * sizeof(mp_digit))) != MP_OKAY) {
return err;
2017-08-30 18:23:46 +00:00
}
2003-02-28 16:09:08 +00:00
/* TODO: We ensure that the highest digit is nonzero. Should this be removed? */
2019-05-23 15:50:58 +00:00
while ((a->dp[digits - 1] & MP_MASK) == 0u) {
2019-05-19 15:16:13 +00:00
if ((err = s_mp_rand_source(a->dp + digits - 1, sizeof(mp_digit))) != MP_OKAY) {
return err;
2017-08-30 18:23:46 +00:00
}
}
2017-08-30 18:23:46 +00:00
a->used = digits;
for (i = 0; i < digits; ++i) {
a->dp[i] &= MP_MASK;
2017-08-30 18:23:46 +00:00
}
2003-02-28 16:08:34 +00:00
2017-08-30 18:23:46 +00:00
return MP_OKAY;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif