Improved error bounds for the Fermat primality test on random inputs

DOI10.1090/mcom/3314zbMath1441.11302arXiv1609.05569OpenAlexW2522957312MaRDI QIDQ3177720

Jared Duker Lichtman, Carl B. Pomerance

Publication date: 1 August 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.05569

zbMATH Keywords

Miller-Rabin testpseudoprimeprobable primeFermat test

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (1)

Algorithms for the Multiplication Table Problem

Cites Work

• Unnamed Item
• The generation of random numbers that are probably prime
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• There are infinitely many Carmichael numbers
• Explicit estimates for the distribution of numbers free of large prime factors
• On the first sign change of $\theta (x) -x$
• Estimating $\pi (x)$ and related functions under partial RH assumptions
• Average Case Error Estimates for the Strong Probable Prime Test
• On the Number of False Witnesses for a Composite Number
• The Probability that a Random Probable Prime is Composite
• Shifted primes without large prime factors
• Further investigations with the strong probable prime test
• The Difference between Consecutive Prime Numbers

This page was built for publication: Improved error bounds for the Fermat primality test on random inputs