A Performance Analysis of a Simple Prime-Testing Algorithm

DOI10.2307/2007543MaRDI QIDQ3665177zbMATH OpenOpenAlexFDO

Authors Marvin Wunderlich

Publication date 1983

Full work available at URL https://doi.org/10.2307/2007543

zbMATH Keywords

Lucas-Lehmer-testprime-testing algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 3950602
• An $O(n^{1/10.89))$ Primality Testing Algorithm,$
• scientific article; zbMATH DE number 3889620
• A Fast Monte-Carlo Test for Primality
• A faster pseudo-primality test
• scientific article; zbMATH DE number 5845877
• Primality testing in polynomial time
• scientific article; zbMATH DE number 1263352
• scientific article; zbMATH DE number 579167
• Simple parallel algorithms for primality testing and integer factorization

Cited in

(1)

• Elliptic Curves and Primality Proving

This page was built for publication: A Performance Analysis of a Simple Prime-Testing Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665177)