Recent developments in primality testing

  title={Recent developments in primality testing},
  author={Carl Pomerance},
  journal={The Mathematical Intelligencer},
  • C. Pomerance
  • Published 1 September 1981
  • Computer Science
  • The Mathematical Intelligencer
ConclusionIs there an algorithm that can decide whethern is prime or composite and that runs in polynomial time? The Adleman-Rumely algorithm and the Lenstra variations come so close, that it would seem that almost any improvement would give the final breakthrough.Is factoring inherently more difficult than distinguishing between primes and composites? Most people feel that this is so, but perhaps this problem too will soon yield.In his “Disquisitiones Arithmeticae” Gauss [9], p. 396, wrote“The… 

The Recognition of Primes

One very important concern in number theory is to establish whether a given number N is prime or composite. At first sight it might seem that in order to decide the question an attempt must be made

How to Recognize Whether a Natural Number is a Prime

The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic.

Number theory and the real world

Number theory has been considered since time immemorial to be the very paradigm of pure (some would say useless) mathematics. According to Carl Friedrich Gauss, the "Princeps Mathemat icorum",

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting

This paper shows that even less restrictive gap-size upper bounds regarding the targets allow one to capture ambiguity-limited classes, and proves that the Lenstra–Pomerance–Wagstaff Conjecture implies that all O-ambiguity NP sets are in the restricted counting class RC PRIMES.

The Reliability of Randomized Algorithms

  • D. Fallis
  • Philosophy
    The British Journal for the Philosophy of Science
  • 2000
The prospects for establishing that randomized algorithms are reliable are analyzed and it is argued that it would be inconsistent for mathematicians to suspend judgement on the truth of mathematical propositions on the basis of worries about the reliability of randomized algorithms.

Implementazione di tests probabilistici di primalità

SuntoIn questo lavoro si considerano due tests probabilistici di primalità per interi disparim di forma qualsiasi. Gli algoritmi sono tali che sem è dichiarato composto allora lo è certamente, mentre

Open problems in number theoretic complexity, II

This chapter presents a collection of 36 open problems in number theoretic complexity, showing how questions about the integers have natural generalizations to rings of integers in an algebraic number field, and questions about elliptic curves may generalize to arbitrary abelian varieties.

On the Stability of m-Sequences

We study the stability of m-sequences in the sense of determining the number of errors needed for decreasing the period of the sequences, as well as giving lower bounds on the k -error linear



On distinguishing prime numbers from composite numbers

  • L. Adleman
  • Computer Science
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and Strassen [36], Miller [27] and Rabin [32] in that its assertions of

On the exact number of primes less than a given limit

The problem of counting the exact number of primes x, wthout actually listing them all, dates from Legendre [l] who observed that the number of primes p for which x p x is one less than where [z]

Some algorithms for prime testing using generalized Lehmer functions

Let N be an odd integer thought to be prime. The properties of special functions which are generalizations of the functions of Lehmer (Ann. of Math., v. 31, 1930, pp. 419-448) are used to develop

Some observations on primality testing

Let N be an integer which is to be tested for primality. Previous methods of ascertaining the primality of N make use of factors of N ? 1, N2 ? N + 1, and N2 + 1 in order to increase the size of any

Riemann's Hypothesis and tests for primality

  • G. Miller
  • Computer Science, Mathematics
  • 1975
It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions.

Some probabilistic remarks on Fermat's last theorem

Let a i < a2 < ' * * be an infinite sequence of integers satisfying ön = (c Ho(l))n a for some a > 1. One can ask: Is it likely that d{ + dj = ar or, more generally, aix + • • • + ain = aif has

Every Prime has a Succinct Certificate

  • V. Pratt
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1975
It remains an open problem whether a prime n can be recognized in only $\log _2^\alpha n$ operations of a Turing machine for any fixed $\alpha $.

Miller's Primality Test

A new lower bound for the pseudoprime counting function

In particular, we may take 5/14. ErdiSs conjectures that (x) x -)where e(x) 0 as x oo. See Pomeranee, Selfridge, Wagstaff [10] for more on this. Our main result holds for pseudoprimes to any base and