# PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts

@article{Phatak2019PPTNL, title={PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts}, author={Dhananjay S. Phatak and Alan T. Sherman and Steven D. Houston and Andrew Henry}, journal={ArXiv}, year={2019}, volume={abs/1908.06964} }

In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as lemmas/corollaries/claims whenever we have complete analytic proof(s); otherwise the results are introduced as conjectures.
In Part/Article 1, we start with the Baseline Primality Conjecture~(PBPC) which enables deterministic primality detection with a low complexity = O…

## Figures and Tables from this paper

## One Citation

Bounds on the Range(s) of Prime Divisors of a Class of Baillie-PSW Pseudo-Primes

- Computer Science
- 2020

It is shown that if a Williams' number is encountered during a search in accordance with all of the conditions in that recipe~\cite{pomerance1984there}~; then it must also be a Baillie-PSW pseudoprime, and new analytic bounds are derived on the prime-divisors of aWilliams' Number.

## References

SHOWING 1-10 OF 32 REFERENCES

Primality Testing with Gaussian Periods

- MathematicsFSTTCS
- 2002

It turns out that the new polynomial time primality test due to Agrawal, Kayal, and Saxena can also be formulated in the Galois theory language, which leads to aPrimality test with a significantly improved guaranteed run time exponent.

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"

- Mathematics
- 2004

1. Introduction: Efficient Primality Testing.- 2. Algorithms for Numbers and Their Complexity.- 3. Fundamentals from Number Theory.- 4. Basics from Algebra: Groups, Rings, and Fields.- 5. The…

The Elliott-Halberstam conjecture implies the Vinogradov least quadratic nonresidue conjecture

- Mathematics
- 2014

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised…

Prime and Prejudice: Primality Testing Under Adversarial Conditions

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

A systematic analysis of primality testing under adversarial conditions, where the numbers being tested for primality are not generated randomly, but instead provided by a possibly malicious party, and promotes the Baillie-PSW primality test which is both efficient and conjectured to be robust even in the adversarial setting for numbers up to a few thousand bits.

The least quadratic non residue

- Mathematics
- 1952

This, the problem of the least quadratic non residue, has often been investigated. The best result is due to Vinogradov, who proved that (1) n(k) = O(k1I(2Ve) where n(k) denotes the least positive…

On the distribution of quadratic residues and nonresidues modulo a prime number

- Mathematics, Computer Science
- 1992

It is proved that the joint distribution of the quadratic characters of the yi 's deviates from the distribution of independent fair coins by no more than t(3 + xfi-)/P, and the randomness complexity of finding these patterns in polynomial time is explored.

Conditional bounds for the least quadratic non-residue and related problems

- Mathematics, Computer ScienceMath. Comput.
- 2015

The existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression are improved and the classical conditional bounds of Littlewood for L-functions at s=1 are refined.

Prime Numbers: A Computational Perspective

- Mathematics
- 2002

Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book,…

New distributed algorithms for fast sign detection in residue number systems (RNS)

- Computer ScienceJ. Parallel Distributed Comput.
- 2016

Lower Bounds for Least Quadratic Non-Residues

- Mathematics
- 1990

Let p be a prime, and let n p denote the least positive integer n such that n is a quadratic non-residue mod p. In 1949, Fridlender [F] and Salie [Sa] independently showed that \( {n_p} = \Omega…