The Factorization of the Ninth Fermat Number

DOI10.2307/2152957zbMath0792.11055OpenAlexW4214899927MaRDI QIDQ3137471

Arjen K. Lenstra, J. M. Pollard, Hendrik W. jun. Lenstra, M. S. Manasse

Publication date: 31 July 1994

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

zbMATH Keywords

number field sievefactoring algorithmninth Fermat number

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Factorization (11Y05)

Related Items (16)

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Finding special factors of values of polynomials at integer points ⋮ The composite character of the twenty-second Fermat number ⋮ Algorithms in Algebraic Number Theory ⋮ Why Does a Prime p Divide a Fermat Number? ⋮ On the complexity of matrix reduction over finite fields ⋮ Periodic binary harmonic functions on lattices ⋮ The Twenty-Second Fermat Number is Composite ⋮ Analyzing massively collaborative mathematics projects ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Factoring with Two Large Primes ⋮ Three new factors of Fermat numbers ⋮ Approximating rings of integers in number fields ⋮ Factorization of the tenth Fermat number

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Probabilistic algorithm for testing primality
• Approximating rings of integers in number fields
• Elliptic Curves and Primality Proving
• How was F 6 Factored?
• Factors of Fermat Numbers and Large Primes of the Form k ⋅2 n + 1
• A Monte Carlo Factoring Algorithm With Linear Storage
• An FFT Extension to the P - 1 Factoring Algorithm
• Primality Testing and Jacobi Sums
• Implementation of a new primality test
• The Multiple Polynomial Quadratic Sieve
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Factorization of the Eighth Fermat Number
• Six New Factors of Fermat Numbers
• A Rigorous Time Bound for Factoring Integers
• Two New Factors of Fermat Numbers
• A Method of Factoring and the Factorization of F 7
• Factoring with Two Large Primes
• Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
• Prime numbers and computer methods for factorization
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

This page was built for publication: The Factorization of the Ninth Fermat Number