1,724 research outputs found
On cyclotomic primality tests
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and shortly after, in 1981, a simplified and more efficient versionwas presented by H.W. Lenstra for the Bourbaki Seminar. Later, in 2008, ReneSchoof presented an updated version of Lenstra\u27s primality test. This thesis presents adetailed description of the cyclotomic primality test as described by Schoof, along withsuggestions for implementation. The cornerstone of the test is a prime congruencerelation similar to Fermat\u27s \little theorem that involves Gauss or Jacobi sumscalculated over cyclotomic fields. The algorithm runs in very nearly polynomial time.This primality test is currently one of the most computationally efficient tests and isused by default for primality proving by the open source mathematics systems Sageand PARI/GP. It can quickly test numbers with thousands of decimal digits
Primality tests, linear recurrent sequences and the Pell equation
We study new primality tests based on linear recurrent sequences of degree
two exploiting a matricial approach. The classical Lucas test arises as a
particular case and we see how it can be easily improved. Moreover, this
approach shows clearly how the Lucas pseudoprimes are connected to the Pell
equation and the Brahamagupta product. We also introduce a new specific
primality test, which we will call generalized Pell test. We perform some
numerical computations on the new primality tests and, for the generalized Pell
test, we do not any pseudoprime up to
Four primality testing algorithms
In this expository paper we describe four primality tests. The first test is
very efficient, but is only capable of proving that a given number is either
composite or 'very probably' prime. The second test is a deterministic
polynomial time algorithm to prove that a given numer is either prime or
composite. The third and fourth primality tests are at present most widely used
in practice. Both tests are capable of proving that a given number is prime or
composite, but neither algorithm is deterministic. The third algorithm exploits
the arithmetic of cyclotomic fields. Its running time is almost, but not quite
polynomial time. The fourth algorithm exploits elliptic curves. Its running
time is difficult to estimate, but it behaves well in practice.Comment: 21 page
- …