Average Case Error Estimates of the Strong Lucas Test. (arXiv:2306.09472v1 [cs.CR])

Reliable probabilistic primality tests are fundamental in public-key
cryptography. In adversarial scenarios, a composite with a high probability of
passing a specific primality test could be chosen. In such cases, we need
worst-case error estimates for the test. However, in many scenarios the numbers
are randomly chosen and thus have significantly smaller error probability.
Therefore, we are interested in average case error estimates. In this paper, we
establish such bounds for the strong Lucas primality test, as only worst-case,
but …

adversarial case cases cryptography error high key numbers public public-key cryptography test tests