Pages that link to "Item:Q594912"

The following pages link to On distinguishing prime numbers from composite numbers (Q594912):

Displaying 38 items.

• A cyclotomic generalization of the sequence \(\gcd(a^n-1, b^n-1)\) (Q259491) (← links)
• Primality test for numbers of the form \(A p^n + w_n\) (Q491620) (← links)
• Factoring on a computer (Q799723) (← links)
• Small exponent point groups on elliptic curves (Q873842) (← links)
• Some uses of microcomputers in number theory research (Q912884) (← links)
• Computing in general Abelian groups is hard (Q1070820) (← links)
• The generation of random numbers that are probably prime (Q1118632) (← links)
• The influence of computers in the development of number theory (Q1164656) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• Recent developments in primality proving (Q1297591) (← links)
• Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\). (Q1401290) (← links)
• Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
• Generalized strong pseudoprime tests and applications (Q1582299) (← links)
• Greatest common divisors and Vojta's conjecture for blowups of algebraic tori (Q1725695) (← links)
• A faster pseudo-primality test (Q1758643) (← links)
• Prime-number algorithm for public-key systems (Q1816016) (← links)
• Short effective intervals containing primes (Q1869779) (← links)
• Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
• Complete congruences of Jacobi sums of order \(2l^2\) with prime \(l\) (Q2097506) (← links)
• Strong pseudoprimes to base 2 (Q2097530) (← links)
• Special factors of holomorphic eta quotients (Q2237397) (← links)
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
• Compositions with the Euler and Carmichael functions (Q2581052) (← links)
• Finding strong pseudoprimes to several bases (Q2701572) (← links)
• Synchronization points and associated dynamical invariants (Q2847202) (← links)
• Information and computation: Classical and quantum aspects (Q3077099) (← links)
• Lower bounds on the lengths of double-base representations (Q3093429) (← links)
• An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers (Q3094297) (← links)
• Elliptic Curves and Primality Proving (Q3137447) (← links)
• Compositeness test with nodal curves (Q3174870) (← links)
• Cyclotomic Numbers and Jacobi Sums: A Survey (Q3298291) (← links)
• Prime values of polynomials and irreducibility testing (Q3331290) (← links)
• Proving primality in essentially quartic random time (Q3420438) (← links)
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
• Squarefree smooth numbers and Euclidean prime generators (Q4592730) (← links)
• (Q5089690) (← links)
• Computation of Jacobi sums of orders \(l^2\) and \(2l^2\) with odd prime \(l\) (Q6107474) (← links)
• Interactions of computational complexity theory and mathematics (Q6198725) (← links)