A Geometric Square-Based Approach to RSA Integer Factorization
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913904798466048 |
|---|---|
| author | Yorozu, Akihisa |
| author_facet | Yorozu, Akihisa |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_17233 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Geometric Square-Based Approach to RSA Integer Factorization Yorozu, Akihisa Cryptography and Security 11Y05 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. |
| title | A Geometric Square-Based Approach to RSA Integer Factorization |
| topic | Cryptography and Security 11Y05 |
| url | https://arxiv.org/abs/2506.17233 |