The Factorization of the Ninth Fermat Number
From MaRDI portal
Recommendations
Cites work
- A Method of Factoring and the Factorization of F 7
- A Monte Carlo Factoring Algorithm With Linear Storage
- A Rigorous Time Bound for Factoring Integers
- An FFT Extension to the P - 1 Factoring Algorithm
- Approximating rings of integers in number fields
- Elliptic Curves and Primality Proving
- Factoring integers with elliptic curves
- Factoring with Two Large Primes
- Factorization of the Eighth Fermat Number
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Factors of Fermat Numbers and Large Primes of the Form k ⋅2 n + 1
- How was F 6 Factored?
- scientific article; zbMATH DE number 4130460 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3841940 (Why is no real title available?)
- scientific article; zbMATH DE number 4165009 (Why is no real title available?)
- scientific article; zbMATH DE number 4075228 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 3641577 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- scientific article; zbMATH DE number 1142300 (Why is no real title available?)
- scientific article; zbMATH DE number 3801619 (Why is no real title available?)
- Implementation of a new primality test
- Primality Testing and Jacobi Sums
- Prime numbers and computer methods for factorization
- Probabilistic algorithm for testing primality
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- Six New Factors of Fermat Numbers
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Multiple Polynomial Quadratic Sieve
- Two New Factors of Fermat Numbers
Cited in
(22)- Approximating rings of integers in number fields
- The composite character of the twenty-second Fermat number
- On the complexity of matrix reduction over finite fields
- Periodic binary harmonic functions on lattices
- How was F 6 Factored?
- Finding special factors of values of polynomials at integer points
- Improved information set decoding for code-based cryptosystems with constrained memory
- Factorization of the Eighth Fermat Number
- Algorithms in Algebraic Number Theory
- A Rigorous Time Bound for Factoring Integers
- Factorization of the tenth Fermat number
- Factoring with Two Large Primes
- New Factors of Fermat Numbers
- scientific article; zbMATH DE number 3995751 (Why is no real title available?)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- The twenty-fourth Fermat number is composite
- The Twenty-Second Fermat Number is Composite
- Addendum: The Factorization of the Ninth Fermat Number
- Three new factors of Fermat numbers
- Why does a prime \(p\) divide a Fermat number?
- Analyzing massively collaborative mathematics projects
- Computation of a 768-bit prime field discrete logarithm
This page was built for publication: The Factorization of the Ninth Fermat Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137471)
