Skip to search formSkip to main contentSkip to account menu

Primality test

Known as: Detecting primes, Compositeness test, Isprime 
A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AC0AKS primality testAdleman–Pomerance–Rumely primality testAlgorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On Future High-Energy Colliders
An outline of the physics reasons to pursue a future programme in high-energy colliders is presented. 
2014
2014
Encryption on Elliptic Curves over Z pq with Arithmetic on E(Z pq ) via E(Z p ) and E(Z q ).
In the study of Diophantine equations elliptic curves play a vital role due to its application in proof of famous Fermat's Las t… 
2012
2012
Polynomial time factoring algorithm using Bayesian arithmetic
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of… 
2011
2011
Applications of elliptic curves in public key cryptography
The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm… 
2011
2011
Algorithm that Solves 3-SAT in Polynomial Time
The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for… 
2010
2010
A primality test for $Kp^n+1$ numbers
In this paper we generalize the classical Proth's theorem for integers of the form $N=Kp^n+1$. For these families, we present a… 
2008
2008
Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem
Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete… 
2008
2008
Fast Primality Proving on Cullen Numbers
We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst… 
1998
1998
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph $G$ of order $n$ is a Cayley graph over the cyclic group ${\bf Z}_n.$ Equivalently, $G$ is circulant iff its… 
1984
1984
ARMA model maximum entropy power spectral estimation
In this paper we show that the appropriate selection of constraints in the variational formulation of spectral estimation leads… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)