Sharpening ``Primes is in P'' for a large family of numbers

  • Berrizbeitia P
14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We give Deterministic Primality tests for large families of numbers. These tests were inspired in the recent and celebrated Agrawal-Kayal-Saxena (AKS) test. The AKS test has proved polynomial complexity O ((log n)^12) and they expect it to be O ((log n)^6) . Our tests have proved complexity O ((log n)^6). The complexity decreases to O ((log n)^4) as the power of 2 dividing n + 1 or n - 1 increases. On large enough primes, our tests, in their worst case, run at least 2^9 times faster than the AKS test.

Cite

CITATION STYLE

APA

Berrizbeitia, P. (2005). Sharpening ``Primes is in P’’ for a large family of numbers. Mathematics of Computation, 74(252), 2043–2060. https://doi.org/10.1090/s0025-5718-05-01727-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free