Primality test

Known as: Detecting primes, Compositeness test, Isprime 
A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
0102019682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… (More)
  • table 2
  • table 3
Is this relevant?
2007
2007
Wc present a theoretically and algorithmically simplified version of a primalitv testing algorithm that was recently invented by… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We give a simple and new randomized primality testing algorithm by reducing primality testing for number n to testing if a… (More)
  • table I
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm… (More)
Is this relevant?
1999
1999
We present a primality proving algorithm—a probablistic primality test that produces short certificates of primality on prime… (More)
  • figure 1
Is this relevant?
1996
1996
We consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N − 1 primality test using Shor’s… (More)
Is this relevant?
1989
1989
We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input <italic>n</italic>, outputs… (More)
Is this relevant?
1989
1989
Several major improvements to the Jacobi sum primdity testing algorithm will speed it up in such a way that proving primality of… (More)
Is this relevant?
1983
1983
We show that any efkient deterministic algorithm fdr finding square roots module a prime can he turned into an efficient Monte C… (More)
Is this relevant?
1979
1979
Theorem 1. Assume that for every integer d that is 1 mod 4 and either prime or the product of two primes, the L-function I= & (k… (More)
Is this relevant?