Recommendations
Cites work
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A method for obtaining digital signatures and public-key cryptosystems
- A p + 1 Method of Factoring
- A Remark on a Paper of Bateman and Horn
- An FFT Extension to the P - 1 Factoring Algorithm
- Coding the Lehmer pseudo-random number generator
- Counting the Integers Factorable via Cyclotomic Methods
- Efficient method for generating strong primes with constraint of bit length
- Evaluation of Artin's Constant and the Twin-Prime Constant
- Factoring integers with elliptic curves
- Factoring polynomials modulo special primes
- Factoring with Cyclotomic Polynomials
- scientific article; zbMATH DE number 51161 (Why is no real title available?)
- scientific article; zbMATH DE number 3460351 (Why is no real title available?)
- scientific article; zbMATH DE number 1303968 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 810480 (Why is no real title available?)
- scientific article; zbMATH DE number 1406787 (Why is no real title available?)
- scientific article; zbMATH DE number 3221530 (Why is no real title available?)
- Maximally equidistributed combined Tausworthe generators
- On the distribution of the power generator
- Proportion of primes generated by strong prime methods
- Random Numbers Generated by Linear Recurrence Modulo Two
- Strong Primes are Easy to Find
- Waring's problem for algebraic number fields and primes of the form \((p^ r -1)/(p^ d-1)\)
Cited in
(5)
This page was built for publication: Optimal strong primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834990)
