A Geometric Square-Based Approach to RSA Integer Factorization

• URL: http://arxiv.org/abs/2506.17233v1
• Date: Sun, 01 Jun 2025 08:55:25 GMT
• Title: A Geometric Square-Based Approach to RSA Integer Factorization
• Authors: Akihisa Yorozu,
• Abstract summary: We present a new approach to RSA factorization inspired by geometric interpretations and square differences.<n>This method reformulates the problem in terms of the distance between perfect squares and provides a recurrence relation that allows rapid convergence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum prime factorization algorithms using binary carry propagation [0.0]
  The RSA cryptosystem relies on the computational difficulty of prime factorization.<n>We propose a quantum annealing based approach to integer factorization using both high order unconstrained binary optimization (HUBO) and constrained quadratic model (CQM)<n>Results show that applying global product constraints enhances factorization accuracy and consistency across all tested instances.
  arXiv  Detail & Related papers  (2025-06-20T07:34:16Z)
• Simple and Provable Scaling Laws for the Test-Time Compute of Large Language Models [70.07661254213181]
  We propose two algorithms that enjoy provable scaling laws for the test-time compute of large language models.<n>One is a two-stage knockout-style algorithm, where each candidate is evaluated by its average win rate against multiple opponents.<n>The other is a two-stage league-style algorithm, where each candidate is evaluated by its average win rate against multiple opponents.
  arXiv  Detail & Related papers  (2024-11-29T05:29:47Z)
• Quantum inspired factorization up to 100-bit RSA number in polynomial time [0.0]
  We attack the RSA factorization building on Schnorr's mathematical framework.<n>We factorize RSA numbers up to 256 bits encoding the optimization problem in quantum systems.<n>Results do not currently undermine the security of the present communication infrastructure.
  arXiv  Detail & Related papers  (2024-10-21T18:00:00Z)
• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• SAT and Lattice Reduction for Integer Factorization [5.035245337299788]
  We describe a new hybrid SAT and computer algebra approach to solve random leaked-bit factorization problems. Our implementation solves random leaked-bit factorization problems significantly faster than either a pure SAT or pure computer algebra approach.
  arXiv  Detail & Related papers  (2024-06-28T17:30:20Z)
• Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes [70.52097560486683]
  We prove that the hardness of approximation of ReLU networks not only mirrors the complexity of the Max-Cut problem but also, in certain special cases, exactly corresponds to it. In particular, when $epsilonleqsqrt84/83-1approx 0.006$, we show that it is NP-hard to find an approximate global dataset of the ReLU network objective with relative error $epsilon$ with respect to the objective value.
  arXiv  Detail & Related papers  (2023-11-18T04:41:07Z)
• An Algebraic-Geometry Approach to Prime Factorization [0.0]
  New algorithms for prime factorization can have a practical impact on present implementations of cryptographic algorithms. We show that there are varieties whose points can be evaluated efficiently given a number of parameters not greater than n/2. In one case, we show that there are varieties whose points can be evaluated efficiently given a number of parameters not greater than n/2.
  arXiv  Detail & Related papers  (2022-09-23T15:31:07Z)
• Integer Factorization with Compositional Distributed Representations [5.119801391862319]
  We present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural networks and potentially implemented on parallel neuromorphic hardware.
  arXiv  Detail & Related papers  (2022-03-02T08:09:17Z)
• Lattice-Based Methods Surpass Sum-of-Squares in Clustering [98.46302040220395]
  Clustering is a fundamental primitive in unsupervised learning. Recent work has established lower bounds against the class of low-degree methods. We show that, perhaps surprisingly, this particular clustering model textitdoes not exhibit a statistical-to-computational gap.
  arXiv  Detail & Related papers  (2021-12-07T18:50:17Z)
• Efficient semidefinite-programming-based inference for binary and multi-class MRFs [83.09715052229782]
  We propose an efficient method for computing the partition function or MAP estimate in a pairwise MRF. We extend semidefinite relaxations from the typical binary MRF to the full multi-class setting, and develop a compact semidefinite relaxation that can again be solved efficiently using the solver.
  arXiv  Detail & Related papers  (2020-12-04T15:36:29Z)
• Optimal Randomized First-Order Methods for Least-Squares Problems [56.05635751529922]
  This class of algorithms encompasses several randomized methods among the fastest solvers for least-squares problems. We focus on two classical embeddings, namely, Gaussian projections and subsampled Hadamard transforms. Our resulting algorithm yields the best complexity known for solving least-squares problems with no condition number dependence.
  arXiv  Detail & Related papers  (2020-02-21T17:45:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.