Lines Matching full:primes
181 some annoying "setup" issues like the primes are smaller which makes ECM factoring more plausible.
211 v1.06 -- Fixed rand_prime() to accept negative inputs as a signal for BBS primes. [Fredrik Olsson]
730 -- I've removed the primes from dh.c and replaced them with DR safe primes suitable for the default
743 Times are all in milliseconds for key generation. New primes times on the left. This makes the code binary
867 -- Changed the DH and ECC code to use base64 static key settings [e.g. the primes]. Dropped the code size by 3KB
902 -- Changed the primality routines around. I now use 8 rounds of Rabin-Miller, I use 256 primes in the sieve
1047 -- replaced the primes in the DH code with new ones that are larger than the size they are
1063 -- Updated the RSA code to make keys a bit quicker [update by Wayne Scott] by not making both primes at the same
1297 -- Fixed rand_prime() so that it makes primes bigger than the setting you give. For example,
1345 does trial divisions against more primes before the Rabin Miller steps
1399 can also make primes congruent to 3 mod 4 [i.e for a blum integer]
