Miller–Rabin primality test

Known as: Miller-Rabin primality test, Miller rabin, Miller-Rabin algorithm 
The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Currently, even the fastest deterministic primality tests run slowly, with the AgrawalKayal-Saxena (AKS) Primality Test runtime… (More)
  • table 4.1
Is this relevant?
2011
2011
The Fermat and Solovay–Strassen tests are each based on translating a congruence modulo prime numbers, either Fermat’s little… (More)
Is this relevant?
2010
2010
The Rabin-Miller primality test is a probabilistic test which can be found in several algebraic computing systems (such as Pari… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
We analyze a variant of the well-known Miller-Rabin test, that may be useful in preventing side-channel attacks to the random… (More)
Is this relevant?
2007
2007
In this paper, possibilities of realization of Miller-Rabin big number primality test on assembler of Texas Instruments digital… (More)
  • table 1
  • table 2
  • table 4
  • table 3
  • table 5
Is this relevant?
2007
2007
In the light of information security it is highly desirable to avoid a “single point of failure” because this would be an… (More)
  • figure 2
  • figure 3
Is this relevant?
2006
2006
In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that… (More)
Is this relevant?
2006
2006
  • Gabriel W. Daleson
  • 2006
The new Agrawal-Kayal-Saxena (AKS) algorithm determines whether a given number is prime or composite in polynomial time, but… (More)
Is this relevant?
2003
2003
Using the HOL theorem prover, we apply our formalization of probability theory to specify and verify the Miller–Rabin… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?