# Miller–Rabin primality test

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 2015

Currently, even the fastest deterministic primality tests run slowly, with the AgrawalKayal-Saxena (AKS) Primality Test runtime… (More)

Is this relevant?

2011

2011

- Encyclopedia of Cryptography and Security
- 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

- 2010

The Rabin-Miller primality test is a probabilistic test which can be found in several algebraic computing systems (such as Pari… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- 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)

Is this relevant?

2009

2009

- J. Mathematical Cryptology
- 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

- 14th International Workshop on Systems, Signals…
- 2007

In this paper, possibilities of realization of Miller-Rabin big number primality test on assembler of Texas Instruments digital… (More)

Is this relevant?

2007

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)

Is this relevant?

2006

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

- 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

- J. Log. Algebr. Program.
- 2003

Using the HOL theorem prover, we apply our formalization of probability theory to specify and verify the Miller–Rabin… (More)

Is this relevant?