A geometric approach to integer factorization

02/10/2018
by   Dmitry I. Khomovsky, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2022

Integer Factorization with Compositional Distributed Representations

In this paper, we present an approach to integer factorization using dis...
research
05/09/2023

A Scalable Evaluation of Integer Factorization Performance on IBM Quantum Simulator

With the development of quantum technologies, the performance of quantum...
research
01/23/2020

Canonical form of modular hyperbolas with an application to integer factorization

For a composite n and an odd c with c not dividing n, the number of solu...
research
03/10/2017

Integer Factorization with a Neuromorphic Sieve

The bound to factor large integers is dominated by the computational eff...
research
07/17/2020

Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard

Distribution networks with periodically repeating events often hold grea...
research
02/10/2020

Palindromic k-Factorization in Pure Linear Time

Given a string s of length n over a general alphabet and an integer k, t...
research
08/25/2019

Optimal Curve Straightening is ∃R-Complete

We prove that the following problem has the same computational complexit...

Please sign up or login with your details

Forgot password? Click here to reset