Searched refs:primality (Results 1 – 8 of 8) sorted by relevance
3 Certificate of primality for:14 Certificate of primality for:25 Certificate of primality for:36 Certificate of primality for:47 Certificate of primality for:58 Certificate of primality for:69 Certificate of primality for:80 Certificate of primality for:91 Certificate of primality for:102 Certificate of primality for:[all …]
14 primality.ps: primality.tif15 tiff2ps -s -e primality.tif > primality.ps26 primality.pdf: primality.ps27 epstopdf primality.ps30 pses: sliding_window.ps expt_state.ps primality.ps design_process.ps31 pdfes: sliding_window.pdf expt_state.pdf primality.pdf design_process.pdf
34 int i, err, primality; in ecc_test() local57 …if ((err = mp_prime_is_prime(modulus, 8, &primality)) != CRYPT_OK) { goto done; } in ecc_test()58 if (primality == 0) { in ecc_test()64 …if ((err = mp_prime_is_prime(order, 8, &primality)) != CRYPT_OK) { goto done; } in ecc_test()65 if (primality == 0) { in ecc_test()
32 1.3.2 to test this number. This function uses the Miller-Rabin primality test.
1604 Performs a Fermat primality test to the base $b$. That is it computes $b^a \mbox{ mod }a$ and test…1680 This will generate a prime in $a$ using $t$ tests of the primality testing algorithms. The variabl…
464 -- Updated primality testing code so it does a minimum of 5 tests [of Miller-Rabin]902 …-- Changed the primality routines around. I now use 8 rounds of Rabin-Miller, I use 256 primes in…1046 -- Fixed bug in dh_test() that wouldn't test the primality of the order of the sub-group
4883 The library includes primality testing and random prime functions as well. The primality tester wi…4885 Rabin-Miller primality testing algorithm. If the candidate passes both phases it is declared prime…