Papers › Integer Factorization By Sieving The Delta
Integer Factorization By Sieving The Delta
Vishal Mudgal
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let n = p·q (p < q) and Δ= |p-q |, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any Δ in zone₀ of some observation deck (od) with specific dial settings. We also introduce a new factorization approach by looking for Δ in different Δ sieve zones. Once Δ is found and n is already given, one can easily find the factors of this composite n from any one of the following quadratic equations: p² + pΔ-n = 0 or q² -qΔ-n = 0. The new factorization approach does not rely on congruence of squares or any special properties of n, p or q and is only based on sieving the Δ. In addition, some other new factorization approaches are also discussed. Finally, a new trapdoor function is presented which is leveraged to encrypt and decrypt a message with different keys. The most fascinating part of the discovery is how addition is used in factorization of a semiprime number by making it yield the difference of its prime factors.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections