Factorization of the Eighth Fermat Number
From MaRDI portal
Recommendations
Cites work
- A Method of Factoring and the Factorization of F 7
- A monte carlo method for factorization
- An improved Monte Carlo factorization algorithm
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- Some Algorithms for Prime Testing Using Generalized Lehmer Function
- Two New Factors of Fermat Numbers
Cited in
(19)- The influence of computers in the development of number theory
- Modifikationen des Pollard-Algorithmus
- Speeding up elliptic curve discrete logarithm computations with point halving
- A limit theorem for the six-length of random functional graphs with a fixed degree sequence
- Cycle structure of iterating Rédei functions
- On random walks for Pollard's rho method
- The Factorization of the Ninth Fermat Number
- How was F 6 Factored?
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Factorization of the tenth Fermat number
- Improved Pollard rho method for computing discrete logarithms over finite extension fields
- Periods of iterations of mappings over finite fields with restricted preimage sizes
- An overview of factoring
- Computational hardness of IFP and ECDLP
- Why does a prime \(p\) divide a Fermat number?
- On the deepest cycle of a random mapping
- Choosing iteration maps for the parallel Pollard rho method
- Toward a theory of Pollard's rho method
- Factoring on a computer
This page was built for publication: Factorization of the Eighth Fermat Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933053)
