Implementation of a new primality test
From MaRDI portal
Recommendations
Cited in
(17)- The generation of random numbers that are probably prime
- Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
- Factoring with the quadratic sieve on large vector computers
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Finding strong pseudoprimes to several bases
- On the running time of the Adleman-Pomerance-Rumely primality test
- Elliptic Curves and Primality Proving
- The Factorization of the Ninth Fermat Number
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- scientific article; zbMATH DE number 3827966 (Why is no real title available?)
- Primality Testing and Jacobi Sums
- Algorithms in Algebraic Number Theory
- scientific article; zbMATH DE number 579167 (Why is no real title available?)
- A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Computational Number Theory, Past, Present, and Future
- Some uses of microcomputers in number theory research
This page was built for publication: Implementation of a new primality test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748326)