Factorization of the Eighth Fermat Number

DOI10.2307/2007666zbMath0476.10007OpenAlexW4214939028WikidataQ56443174 ScholiaQ56443174MaRDI QIDQ3933053

Richard P. Brent, J. M. Pollard

Publication date: 1981

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

zbMATH Keywords

rho methodMonte Carlo factorization algorithmeighth Fermat number

Mathematics Subject Classification ID

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

Related Items

Cycle structure of iterating Rédei functions ⋮ Improved algorithm for the isogeny problem for ordinary elliptic curves ⋮ Unnamed Item ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ Improved Pollard rho method for computing discrete logarithms over finite extension fields ⋮ On random walks for Pollard's rho method ⋮ The influence of computers in the development of number theory ⋮ Why Does a Prime p Divide a Fermat Number? ⋮ The Factorization of the Ninth Fermat Number ⋮ Computational hardness of IFP and ECDLP ⋮ A limit theorem for the six-length of random functional graphs with a fixed degree sequence ⋮ Toward a theory of Pollard's rho method ⋮ Factorization of the tenth Fermat number ⋮ Factoring on a computer ⋮ An Overview of Factoring

Cites Work

• Unnamed Item
• An improved Monte Carlo factorization algorithm
• Two New Factors of Fermat Numbers
• A Method of Factoring and the Factorization of F 7
• A monte carlo method for factorization
• Some Algorithms for Prime Testing Using Generalized Lehmer Function