Cryptography Reference
In-Depth Information
}
Set the prime number candidate
p_l
←
2
*p_l
+1
;thus
p_l
is odd.
shl_l (p_l);
inc_l (p_l);
cpy_l (rmin1_l, p_l);
dec_l (rmin1_l);
gcd_l (rmin1_l, f_l, g_l);
dec_l (NoofCandidates_l);
}
while (!(EQONE_L (g_l) && ISPRIME_L (p_l)));
return error;
}
The following two functions are by-products, so to speak, of the previous
function. We first generate pseudorandom prime numbers with a specified
number of binary digits and with the additional property of being relatively prime
to a specified integer. For this we use the function
FindPrimeMinMaxGcd_l()
:
