ibphoenix/tomsfastmath
6
0
Fork 1
Code Issues Pull Requests Packages Releases Wiki Activity

Fix a bug in case the most significants bits were generated as zero.

Browse Source
This commit is contained in:
Giovanni Bajo 2011-09-27 01:57:58 +02:00
parent 3d5ada60c3
commit faf0f96de1
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/numtheory/fp_prime_random_ex.c
View File

@ -55,6 +55,10 @@ int fp_prime_random_ex(fp_int *a, int size, int flags, tfm_prime_callback cb, vo
/* make sure the MSbyte has the required number of bits */ /* make sure the MSbyte has the required number of bits */
a->dp[dsize-1] &= maskAND_msb; a->dp[dsize-1] &= maskAND_msb;
/* Force a->used as well, it could be smaller if the highest bits were
generated as 0 by the callback. */
a->used = dsize;
/* modify the LSbyte as requested */ /* modify the LSbyte as requested */
a->dp[0] |= maskOR_lsb; a->dp[0] |= maskOR_lsb;