scientific article

From MaRDI portal

Revision as of 22:03, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3220644

Jump to:navigation, search

zbMath0556.10003MaRDI QIDQ3220644

Samuel S. jun. Wagstaff, Carl B. Pomerance

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational number theory factoring methods large integers continued fraction technique choice of the multiplier early abort strategy large prime variation

Mathematics Subject Classification ID

Continued fractions (11A55) Primes (11A41) Algorithms in computer science (68W99)

Related Items (10)

Modern factorization methods ⋮ Some uses of microcomputers in number theory research ⋮ Factoring: algorithms, computations, and computers ⋮ A parallel version of the continued fraction integer factoring algorithm ⋮ On computing ord\(_{N}(2)\) and its application ⋮ CFRAC ⋮ Factoring on a computer ⋮ New Ideas for Factoring Large Integers ⋮ Factoring Numbers on the Massively Parallel Computer ⋮ Root optimization of polynomials in the number field sieve

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3220644&oldid=16384548"