On the Number of False Witnesses for a Composite Number

DOI10.2307/2008231zbMath0586.10003OpenAlexW1971911265WikidataQ56446478 ScholiaQ56446478MaRDI QIDQ3712368

Carl B. Pomerance

Publication date: 1986

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

Full work available at URL: https://semanticscholar.org/paper/88405d2486bb008b14c90680aefcc0b9ea59e0ed

zbMATH Keywords

computational number theoryprimality testingfalse witnessesstate of the art reporteasy Fermat test for compositenessEuler teststrong pseudoprime tests

Mathematics Subject Classification ID

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

Related Items (8)

Improved error bounds for the Fermat primality test on random inputs ⋮ On the Average Number of Groups of Square-Free Order ⋮ The generation of random numbers that are probably prime ⋮ The Probability that a Random Probable Prime is Composite ⋮ Statistical distribution and collisions of VSH ⋮ Elliptic Pseudoprimes ⋮ Average liar count for degree-$2$ Frobenius pseudoprimes ⋮ Counting composites with two strong liars

This page was built for publication: On the Number of False Witnesses for a Composite Number