A geometric approach to integer factorization
arXiv:1802.036581.2h-index: 3
Originality Synthesis-oriented
AI Analysis
This is an incremental theoretical approach to integer factorization, a fundamental problem in cryptography.
The paper presents a geometric method for integer factorization by approximating segments of the curve y=n/x, but no concrete results or performance numbers are provided.
We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.