tommath/bn_mp_prime_random_ex.c

125 lines
3.6 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_PRIME_RANDOM_EX_C
2004-04-11 16:46:22 -04:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
* LibTomMath is a library that provides multiple-precision
* integer arithmetic as well as number theoretic functionality.
*
* The library was designed directly after the MPI library by
* 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
2004-04-11 16:46:22 -04:00
*/
/* makes a truly random prime of a given size (bits),
*
* Flags are as follows:
*
* LTM_PRIME_BBS - make prime congruent to 3 mod 4
* LTM_PRIME_SAFE - make sure (p-1)/2 is prime as well (implies LTM_PRIME_BBS)
* LTM_PRIME_2MSB_ON - make the 2nd highest bit one
*
* You have to supply a callback which fills in a buffer with random bytes. "dat" is a parameter you can
* have passed to the callback (e.g. a state or something). This function doesn't use "dat" itself
* so it can be NULL
*
*/
/* This is possibly the mother of all prime generation functions, muahahahahaha! */
int mp_prime_random_ex(mp_int *a, int t, int size, int flags, ltm_prime_callback cb, void *dat)
{
unsigned char *tmp, maskAND, maskOR_msb, maskOR_lsb;
int res, err, bsize, maskOR_msb_offset;
/* sanity check the input */
if ((size <= 1) || (t <= 0)) {
2004-04-11 16:46:22 -04:00
return MP_VAL;
}
/* LTM_PRIME_SAFE implies LTM_PRIME_BBS */
2015-10-25 11:49:26 -04:00
if ((flags & LTM_PRIME_SAFE) != 0) {
2004-04-11 16:46:22 -04:00
flags |= LTM_PRIME_BBS;
}
/* calc the byte size */
2004-12-22 21:40:37 -05:00
bsize = (size>>3) + ((size&7)?1:0);
2004-04-11 16:46:22 -04:00
/* we need a buffer of bsize bytes */
tmp = OPT_CAST(unsigned char) XMALLOC(bsize);
if (tmp == NULL) {
return MP_MEM;
}
/* calc the maskAND value for the MSbyte*/
2004-12-22 21:40:37 -05:00
maskAND = ((size&7) == 0) ? 0xFF : (0xFF >> (8 - (size & 7)));
2004-04-11 16:46:22 -04:00
/* calc the maskOR_msb */
maskOR_msb = 0;
2005-02-12 03:40:15 -05:00
maskOR_msb_offset = ((size & 7) == 1) ? 1 : 0;
2015-10-25 11:49:26 -04:00
if ((flags & LTM_PRIME_2MSB_ON) != 0) {
2005-08-01 12:37:28 -04:00
maskOR_msb |= 0x80 >> ((9 - size) & 7);
}
2004-04-11 16:46:22 -04:00
/* get the maskOR_lsb */
2005-02-12 03:40:15 -05:00
maskOR_lsb = 1;
2015-10-25 11:49:26 -04:00
if ((flags & LTM_PRIME_BBS) != 0) {
2004-04-11 16:46:22 -04:00
maskOR_lsb |= 3;
}
do {
/* read the bytes */
if (cb(tmp, bsize, dat) != bsize) {
err = MP_VAL;
goto error;
}
/* work over the MSbyte */
tmp[0] &= maskAND;
tmp[0] |= 1 << ((size - 1) & 7);
/* mix in the maskORs */
tmp[maskOR_msb_offset] |= maskOR_msb;
tmp[bsize-1] |= maskOR_lsb;
/* read it in */
if ((err = mp_read_unsigned_bin(a, tmp, bsize)) != MP_OKAY) { goto error; }
/* is it prime? */
if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; }
2004-10-29 18:07:18 -04:00
if (res == MP_NO) {
continue;
}
2004-04-11 16:46:22 -04:00
2015-10-25 11:49:26 -04:00
if ((flags & LTM_PRIME_SAFE) != 0) {
2004-04-11 16:46:22 -04:00
/* see if (a-1)/2 is prime */
if ((err = mp_sub_d(a, 1, a)) != MP_OKAY) { goto error; }
if ((err = mp_div_2(a, a)) != MP_OKAY) { goto error; }
/* is it prime? */
if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; }
}
} while (res == MP_NO);
2015-10-25 11:49:26 -04:00
if ((flags & LTM_PRIME_SAFE) != 0) {
2004-04-11 16:46:22 -04:00
/* restore a to the original value */
if ((err = mp_mul_2(a, a)) != MP_OKAY) { goto error; }
if ((err = mp_add_d(a, 1, a)) != MP_OKAY) { goto error; }
}
err = MP_OKAY;
error:
XFREE(tmp);
return err;
}
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$ */