The following pages link to Primality Testing and Jacobi Sums (Q3699757):
Displaying 19 items.
- Primality test for numbers of the form \(A p^n + w_n\) (Q491620) (← links)
- Factoring on a computer (Q799723) (← links)
- Some uses of microcomputers in number theory research (Q912884) (← 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)
- A faster pseudo-primality test (Q1758643) (← links)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272) (← links)
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach (Q2700038) (← links)
- Finding strong pseudoprimes to several bases (Q2701572) (← links)
- An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers (Q3094297) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test (Q3147182) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- Explicit Bounds for Primality Testing and Related Problems (Q3478501) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Sharpening ``Primes is in P'' for a large family of numbers (Q5315434) (← links)
- Primality testing (Q5903157) (← links)
