A Geometric Square-Based Approach to RSA Integer Factorization
Cryptography and Security
2025-06-24 v1
Abstract
We present a new approach to RSA factorization inspired by geometric interpretations and square differences. This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that allows rapid convergence when the RSA modulus has closely spaced prime factors. Although this method is efficient for small semiprimes, it does not yet succeed in factoring large challenges like RSA-100 in practical time, highlighting both its potential and current limitations.
Cite
@article{arxiv.2506.17233,
title = {A Geometric Square-Based Approach to RSA Integer Factorization},
author = {Akihisa Yorozu},
journal= {arXiv preprint arXiv:2506.17233},
year = {2025}
}
Comments
3 pages