Fermat primality test

Known as: Fermat's primality test, Fermat liars, Fermat liar 
The Fermat primality test is a probabilistic test to determine whether a number is a probable prime.
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2017
012319992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2015
Review
2015
Let Fp = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(T ) ∈ Fp[T ] is irreducible… (More)
Is this relevant?
2014
2014
JPV algorithm, proposed by Joye et al. was predicted to be faster than the combined prime generation algorithm but it runs slower… (More)
  • table I
  • table II
  • table IV
Is this relevant?
2014
2014
JPV algorithm, proposed by Joye et al. was predicted to be faster than the combined prime generation algorithm but it runs slower… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2014
2014
Cunningham chains of length n of the first kind are n long sequences of prime numbers p1, p2, . . . , pn so that pi+1 = 2pi + 1… (More)
Is this relevant?
2011
2011
  • Encyclopedia of Cryptography and Security
  • 2011
 
Is this relevant?
2005
2005
 
Is this relevant?
2004
2004
The first deterministic polynomial-time algorithm for primality testing by Agrawal, Kayal, and Saxena [Agrawal et al. 02] has… (More)
Is this relevant?
2000
2000
For n odd, the strong pseudoprime primality test (also called the Miller–Rabin test c.f. Miller, 1976, Rabin, 1980, Koblitz, 1987… (More)
Is this relevant?
1999
1999
Based on the well-known Baillie/Wagstaff suggestion [2] we introduce a rapid pseudoprimality test with high confidence. The test… (More)
Is this relevant?