Three new factors of Fermat numbers
From MaRDI portal
Publication:4955877
DOI10.1090/S0025-5718-00-01207-2zbMath1042.11082MaRDI QIDQ4955877
C. van Halewyn, Karl Dilcher, Richard P. Brent, Richard E. Crandall
Publication date: 22 May 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Factorization (11Y05)
Related Items
Cites Work
- Advances in cryptology -- EUROCRYPT '92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings
- Factoring integers with elliptic curves
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Fast computation of continued fraction expansions.
- The Factorization of the Ninth Fermat Number
- A Practical Analysis of the Elliptic Curve Factoring Algorithm
- Factors of Fermat Numbers and Large Primes of the Form k ⋅2 n + 1
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Two New Factors of Fermat Numbers
- Factorization of the tenth Fermat number
- Discrete Weighted Transforms and Large-Integer Arithmetic
- New Factors of Fermat Numbers
- The Twenty-Second Fermat Number is Composite
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item