Factorization of the tenth Fermat number
From MaRDI portal
Publication:4221993
DOI10.1090/S0025-5718-99-00992-8zbMath0977.11053OpenAlexW2058026380WikidataQ55739200 ScholiaQ55739200MaRDI QIDQ4221993
Publication date: 3 December 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-99-00992-8
factorizationFermat numberinteger factorizationelliptic curve methodCunningham project\(F_{10}\)\(F_{11}\)\(F_9\)
Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Factorization (11Y05) Primality (11Y11)
Related Items
Finding special factors of values of polynomials at integer points ⋮ Introduction ⋮ Why Does a Prime p Divide a Fermat Number? ⋮ Three new factors of Fermat numbers ⋮ A note on factors of generalized Fermat numbers
Uses Software
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The development of the number field sieve
- Factoring integers with elliptic curves
- Analysis of a simple factorization algorithm
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Prime numbers and computer methods for factorization.
- An Implementation of the Number Field Sieve
- Elliptic Curves and Primality Proving
- The Factorization of the Ninth Fermat Number
- A Practical Analysis of the Elliptic Curve Factoring Algorithm
- How was F 6 Factored?
- Factors of Fermat Numbers and Large Primes of the Form k ⋅2 n + 1
- The Multiple Polynomial Quadratic Sieve
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- An improved Monte Carlo factorization algorithm
- Factorization of the Eighth Fermat Number
- Succinct Proofs of Primality for the Factors of Some Fermat Numbers
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- 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
- A method for obtaining digital signatures and public-key cryptosystems
- Discrete Weighted Transforms and Large-Integer Arithmetic
- New Factors of Fermat Numbers
- Factoring Integers with Large-Prime Variations of the Quadratic Sieve
- Subtleties in the Distribution of the Numbers of Points on Elliptic Curves Over a Finite Prime Field
- Detecting perfect powers in essentially linear time
- The Twenty-Second Fermat Number is Composite
- New Cullen Primes
- Three new factors of Fermat numbers
- On the field of combinatory analysis
- Ordered Cycle Lengths in a Random Permutation
- On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Some Miscellaneous Factorizations
- Mersenne and Fermat Numbers
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
