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)

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

Highly Cited

2010

Highly Cited

2010

- Eric Bach
- 2010

Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… (More)

Is this relevant?

2007

2007

Wc present a theoretically and algorithmically simplified version of a primalitv testing algorithm that was recently invented by… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Manindra Agrawal, Somenath Biswas
- J. ACM
- 2003

We give a simple and new randomized primality testing algorithm by reducing primality testing for number n to testing if a… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Alexander Schrijver
- J. Comb. Theory, Ser. B
- 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

- Shafi Goldwasser, Joe Kilian
- J. ACM
- 1999

We present a primality proving algorithm—a probablistic primality test that produces short certificates of primality on prime… (More)

Is this relevant?

1996

1996

- Hoi Fung Chau, H.-K. Lo
- 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

- Erich Kaltofen, T. Valente, Norika Yui
- ISSAC
- 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

- Wieb Bosma, Marc-Paul van der Hulst
- EUROCRYPT
- 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

- James Finn, Karl J. Lieberherr
- Theor. Comput. Sci.
- 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

- Hendrik W. Lenstra
- Inf. Process. Lett.
- 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?