Factoring with Two Large Primes

DOI10.2307/2153299zbMath0806.11070OpenAlexW2046040650MaRDI QIDQ4317677

Arjen K. Lenstra, M. S. Manasse

Publication date: 20 December 1994

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

zbMATH Keywords

number field sievefactoring algorithmmultiple polynomial quadratic sieve

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (7)

Running Time Predictions for Factoring Algorithms ⋮ Computation of discrete logarithms in prime fields ⋮ The Factorization of the Ninth Fermat Number ⋮ Rigorous analysis of a randomised number field sieve ⋮ Algebraic curves and cryptography ⋮ A double large prime variation for small genus hyperelliptic index calculus ⋮ On the number of semismooth integers

Cites Work

• The development of the number field sieve
• The Factorization of the Ninth Fermat Number
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
• An algorithm for the blocks and cutnodes of a graph
• 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
• Unnamed Item

This page was built for publication: Factoring with Two Large Primes