Lines Matching full:prime
405 -- Fixed rsa_import() so that it would detect multi-prime RSA keys and error appropriately
672 -- Massive updates to the prime generation code. I use the LTM random prime functions [and provide a nice
674 depending on the input size. This nicely speeds up most prime generation/testing within the library.
793 -- Optimized prime.c to not include a 2nd prime table, removed code from is_prime calls prime
917 -- Fixed some mistakes concerning prime generation in the manual.
957 v0.72 -- Fixed bug in the prime testing. In the Miller-Rabin test I was raising the base to "N-1" not "r".
1048 associated with. That is a 1024-bit DH key will have a 1025-bit prime as the modulus
1052 -- Added an additional check for memory errors in is_prime() and cleaned up prime.c a bit
1247 -- Fixed a bug in prime.c that would not use the correct table if you undefined SMALL_PRIME_TAB
1298 if you want a 1024-bit prime it would make a 1023-bit one. Now it ensures that the prime
1299 it makes is always greater than 2^(8n) (n == bytes in prime). This doesn't have a huge
1357 a negative len to get a "3 mod 4" style prime... oops
1396 makes a random integer and increments by two until a prime is found
1421 v0.17 -- Fixed a bug in the random prime generator that fixes the wrong bits to one
1422 -- ECC and DH code verify that the moduli and orders are in fact prime. That
1434 find a 1792 and 2048-bit strong prime but what the heck
