## Compositeness test with nodal curves

- Enver Ozdemir
- Int. J. Comput. Math.
- 2017

- Published 2003 in Math. Comput.
DOI:10.1090/S0025-5718-03-01545-X

Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of ψm, we will have, for integers n < ψm, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the ψm are known for 1 ≤ m ≤ 8. Upper bounds for ψ9, ψ10 and ψ11 were first given by… (More)

### Presentations referencing similar topics