Large Random Numbers - Cryptography in C and C++ - page 288

int
RandMinMax_l (CLINT r_l, STATEPRNG *xrstate, CLINT rmin_l, CLINT rmax_l)
{

CLINT t_l;
int error = E_CLINT_OK;
USHORT l = ld_l (rmax_l);

Plausibility: Is rmin_l ≤ rmax_l ?

if (GT_L (rmin_l, rmax_l))
{

return E_CLINT_RGE;

}

Form auxiliary variable t_l := rmax_l - rmin_l + 1 .

sub_l (rmax_l, rmin_l, t_l);
inc_l (t_l);

Search for random number less than or equal to 2 ld ( rmax_l .

switch (xrstate->Generator)
{

case FLINT_RNDAES:
error = RandAES_l (r_l, &xrstate->StateAES,
MIN (l, (int)CLINTMAXBIT));

break;
case FLINT_RNDRMDSHA1:
error = RandRMDSHA1_l (r_l, &xrstate->StateRMDSHA1,
MIN (l, (int)CLINTMAXBIT));

break;
case FLINT_RNDBBS:
error = RandBBS_l (r_l, &xrstate->StateBBS,
MIN (l, (int)CLINTMAXBIT));

break;