Integer factorization as subset-sum problem

DOI10.1016/j.jnt.2023.02.010OpenAlexW4360603857MaRDI QIDQ2700674

Markus Hittmeir

Publication date: 27 April 2023

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.10074

zbMATH Keywords

factorizationprimality

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Prime numbers and computer methods for factorization.
• Modular hyperbolas
• Approximate formulas for some functions of prime numbers
• Faster deterministic integer factorization
• Improved Generic Algorithms for Hard Knapsacks
• A babystep-giantstep method for faster deterministic integer factorization
• New Generic Algorithms for Hard Knapsacks
• Speeding Fermat’s factoring method
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Factoring Large Integers
• An exponent one-fifth algorithm for deterministic integer factorisation
• A time-space tradeoff for Lehman’s deterministic integer factorization method
• A log-log speedup for exponent one-fifth deterministic integer factorisation
• Fast Modular Subset Sum using Linear Sketching

This page was built for publication: Integer factorization as subset-sum problem