The generation of random numbers that are probably prime
Copyright policy )The generation of random numbers that are probably prime
This paper discusses Rabin's probabilistic primality test. It states, rather provocatively, that Rabin's test can only fail with a nonnegligible probability if the test number is easy to split into two nontrivial factors. Furthermore, it discusses how Rabin's test can be used to generate random probable prime numbers (rather than test a specific integer for primality).
- University of Montreal Canada
- University of Georgia Georgia
- Massachusetts Institute of Technology United States
- University of Georgia Press United States
Primality, generation of random primes, Fermat's test, Cryptography, Random number generation in numerical analysis, false witnesses, Rabin's probabilistic primality test, random probable prime numbers
Primality, generation of random primes, Fermat's test, Cryptography, Random number generation in numerical analysis, false witnesses, Rabin's probabilistic primality test, random probable prime numbers
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).24 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!