Abstract
We consider the uniform distribution of solutions to , and obtain a bound on the second moment of the number of solutions in squares of length approximately . We use this to study a new factoring algorithm that factors provably in time, and discuss the potential for improving the runtime to sub-exponential.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.