Concept

Adleman–Pomerance–Rumely primality test

Summary
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time: : (\log n)^{O(\log,\log,\log n)}. Software implementations
  • UBASIC provides an implementation under the name APRT-CLE (APR Test CL extended) *A factoring applet that uses APR-CL on certain conditions (source code included) *Pari/GP uses APR-CL conditionally in its implementatio
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading