Canonical form of modular hyperbolas with an application to integer factorization

01/23/2020
by   Juan Di Mauro, et al.
0

For a composite n and an odd c with c not dividing n, the number of solutions to the equation n+a≡ b c with a,b quadratic residues modulus c is calculated. We establish a direct relation with those modular solutions and the distances between points of a modular hyperbola. Furthermore, for certain composite moduli c, an asymptotic formula for quotients between the number of solutions and c is provided. Finally, an algorithm for integer factorization using such solutions is presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2018

A geometric approach to integer factorization

We give a geometric approach to integer factorization. This approach is ...
research
03/02/2022

Integer Factorization with Compositional Distributed Representations

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

Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices

Consider a class of simplices defined by systems A x ≤ b of linear inequ...
research
01/19/2017

The number of realizations of a Laman graph

Laman graphs model planar frameworks that are rigid for a general choice...
research
06/28/2021

Notes on {a,b,c}-Modular Matrices

Let A ∈ℤ^m × n be an integral matrix and a, b, c ∈ℤ satisfy a ≥ b ≥ c ≥ ...
research
04/09/2022

An Improved Integer Modular Multiplicative Inverse (modulo 2^w)

This paper presents an algorithm for the integer multiplicative inverse ...
research
06/10/2018

Analysis of Nederlof's algorithm for subset sum

In 2017, J. Nederlof proposed an algorithm [Information Processing Lette...

Please sign up or login with your details

Forgot password? Click here to reset