Fermat Primality Test
A probabilistic primality testing algorithm based on Fermat's little theorem, which detects composites by randomly selecting bases and may misclassify pseudoprimes.
Timeline (last 90 days)
Gurevich reformulates the probabilistic algorithm of the simplified Fermat primality test as: a deterministic algorithm that itself calls an oracle named `choose in` to obtain random numbers.
Gurevich's oracle-pattern framework requires that an algorithm's behavioral guarantees depend on assumptions about the oracle's behavior, for example, the reliability of the Fermat test depends on the quality of the random source.
All Facts (2)
Gurevich reformulates the probabilistic algorithm of the simplified Fermat primality test as: a deterministic algorithm that itself calls an oracle named `choose in` to obtain random numbers.
50%UnverifiedGurevich's oracle-pattern framework requires that an algorithm's behavioral guarantees depend on assumptions about the oracle's behavior, for example, the reliability of the Fermat test depends on the quality of the random source.
50%