libtommath/bn_mp_rand.c

68 lines
1.3 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_RAND_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.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 16:08:34 +00:00
*/
/* makes a pseudo-random int of a given size */
static mp_digit mp_gen_random(void)
{
mp_digit d;
d = ((mp_digit) abs (MP_GEN_RANDOM()));
#if MP_DIGIT_BIT > 32
d <<= 32;
d |= ((mp_digit) abs (MP_GEN_RANDOM()));
#endif
d &= MP_MASK;
return d;
}
2003-02-28 16:08:34 +00:00
int
mp_rand (mp_int * a, int digits)
{
2003-02-28 16:09:08 +00:00
int res;
mp_digit d;
2003-02-28 16:08:34 +00:00
mp_zero (a);
if (digits <= 0) {
return MP_OKAY;
}
/* first place a random non-zero digit */
2003-02-28 16:09:08 +00:00
do {
d = mp_gen_random();
2003-02-28 16:09:08 +00:00
} while (d == 0);
2003-02-28 16:08:34 +00:00
if ((res = mp_add_d (a, d, a)) != MP_OKAY) {
return res;
}
2005-03-12 11:55:11 +00:00
while (--digits > 0) {
2003-02-28 16:09:08 +00:00
if ((res = mp_lshd (a, 1)) != MP_OKAY) {
2003-02-28 16:08:34 +00:00
return res;
}
2003-02-28 16:09:08 +00:00
if ((res = mp_add_d (a, mp_gen_random(), a)) != MP_OKAY) {
2003-02-28 16:08:34 +00:00
return res;
}
}
return MP_OKAY;
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */