The distribution of solutions to xy = N mod a with an application to factoring integers

Type: Preprint

Publication Date: 2006-10-20

Citations: 0

Locations

  • arXiv (Cornell University) - View

Similar Works

Action Title Year Authors
+ The distribution of solutions to xy = N mod a with an application to factoring integers 2006 Michael Rubinstein
+ THE DISTRIBUTION OF SOLUTIONS TO xy = n (mod a) WITH AN APPLICATION TO FACTORING INTEGERS 2014 Michael Rubinstein
+ Hide and Seek- a naive factoring algorithm 2006 Michael Rubinstein
+ PDF Chat Finding almost squares 2006 Tsz Ho Chan
+ Computational methods for factoring large integers 1988 M. C. Wunderlich
+ PDF Chat Deterministic factorization of sums and differences of powers 2016 Markus Hittmeir
+ A pólya algorithm for the favard solution, N-width characterizations and Whitney type theorems 1975 Stephen D. Fisher
Joseph W. Jerome
+ The South Caicos Factoring Algorithm 2020 Michael Rubinstein
+ Sums of divisors, perfect numbers, and factoring 1984 Eric Bach
Gary L. Miller
Jeffrey Shallit
+ An Algorithm to Generate Random Factored Smooth Integers 2020 Eric Bach
Jonathan Sorenson
+ Covering integers by $x^2 + dy^2$ 2024 Ben Green
K. Soundararajan
+ Turning Euler's Factoring Method into a Factoring Algorithm 1996 James McKee
+ An Algorithm to Generate Random Factored Smooth Integers. 2020 Eric Bach
Jonathan Sorenson
+ Factoring integers 2013 Joachim von zur Gathen
Jürgen Gerhard
+ Divisibility of the central binomial coefficient $\binom {2n}{n}$ 2020 Kevin Ford
Sergeĭ Konyagin
+ Introduction to Integer Factorisation Algorithms 2010 Richard P. Brent
+ A Sieve Method for Factoring Numbers of the Form n 2 + 1 1959 Daniel Shanks
+ Factoring integers and computing discrete logarithms via diophantine approximation 1993 C. P. Schnorr
+ 7.4 Factoring Trinomials where a ≠ 1 2020 Terrance Berg
+ A sieve method for factoring numbers of the form 𝑛²+1 1959 Daniel Shanks

Works That Cite This (0)

Action Title Year Authors