aboutsummaryrefslogtreecommitdiffstats
path: root/src/math/gfpmath/curve_gfp.cpp
diff options
context:
space:
mode:
authorlloyd <[email protected]>2009-07-11 15:30:21 +0000
committerlloyd <[email protected]>2009-07-11 15:30:21 +0000
commitb7b1d9a4371d5f4481437f1e21fa0c993938c912 (patch)
tree493bd629207405e5e380a6e58490ad2dd30c4365 /src/math/gfpmath/curve_gfp.cpp
parent7308b52db7689bb1d393135ca1818f768600e7f9 (diff)
Fix generating primes between 4 and 7 bits. The problem was that when
verify mode is not set, by default the Miller-Rabin bases are chosen from the small primes. Generally speaking these make good test bases. However if the prime to be generated is very small, we will choose a base which is out of range. If the i'th prime is too big to be a base, then just choose a random integer of the appropriate size instead.
Diffstat (limited to 'src/math/gfpmath/curve_gfp.cpp')
0 files changed, 0 insertions, 0 deletions