Pages that link to "Item:Q3748326"
From MaRDI portal
The following pages link to Implementation of a new primality test (Q3748326):
Displayed 13 items.
- Some uses of microcomputers in number theory research (Q912884) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\). (Q1401290) (← links)
- Factoring with the quadratic sieve on large vector computers (Q1825224) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Finding strong pseudoprimes to several bases (Q2701572) (← 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)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n (Q5074029) (← links)
- Speeding up the computations on an elliptic curve using addition-subtraction chains (Q5202278) (← links)
- Computational Number Theory, Past, Present, and Future (Q6082847) (← links)