Matthew Julius Raibert wrote:
It also seems unusual that what appears to be a generic function call in
the bignum library is in fact a helper function for a specific
application and as such not useful for others. Writing my own prime
generator is simple enough, but perhaps BN_generate_prime wo
It also seems unusual that what appears to be a generic function call in
the bignum library is in fact a helper function for a specific application
and as such not useful for others. Writing my own prime generator is
simple enough, but perhaps BN_generate_prime would be more appropriately
name
Michael Sierchio wrote:
Nils Larsch wrote:
Matthew Julius Raibert wrote:
I'm working on a project for which I need to generate big primes.
Along the way I noticed that when I run BN_generate_prime() it seems
to always set the two most significant bits to one. In other words,
if I ask for
Nils Larsch wrote:
Matthew Julius Raibert wrote:
I'm working on a project for which I need to generate big primes.
Along the way I noticed that when I run BN_generate_prime() it seems
to always set the two most significant bits to one. In other words,
if I ask for a thousand 16 bit primes,
Matthew Julius Raibert wrote:
I'm working on a project for which I need to generate big primes. Along
the way I noticed that when I run BN_generate_prime() it seems to always
set the two most significant bits to one. In other words, if I ask for
a thousand 16 bit primes, I get a thousand pr
I'm working on a project for which I need to generate big primes. Along
the way I noticed that when I run BN_generate_prime() it seems to always
set the two most significant bits to one. In other words, if I ask for a
thousand 16 bit primes, I get a thousand primes that lie between hex C000
