Gaussian integers with small prime factors by D. G. Hazlewood

Subjects: Get full text

HUBO and QUBO models for prime factorization by Kyungtaek Jun, Hyunju Lee

“…This paper presents a prime factorization method using a D-Wave quantum computer that could threaten the RSA cryptosystem in the future. …”
Get full text

Towards a Prime Factorization of Proteins by Radev, Simeon

Get full text

ON THE ASYMPTOTIC-DISTRIBUTION OF LARGE PRIME FACTORS by Donnelly, P, Grimmett, G

The largest prime factor of the integers in an interval by Heath-Brown, D

“…It is proved that the range (x, x+x1/2+ε) has such an integer that one of its prime factors p≥x11/12-ε.…”

Carmichael numbers with three prime factors by Heath-Brown, D

Prime Factorization And Domination In The Hierarchical Product Of Graphs by Anderson S.E., Guob Y., Tenney A., Wash K.A.

“…It is known that every connected graph has a unique prime factor decomposition with respect to the Cartesian product. …”
Get full text

Some Observations on the Greatest Prime Factor of an Integer by Jakimczuk Rafael

Subjects: “…greatest prime factor…”
Get full text

The largest prime factor of $X^3+2$ by Heath-Brown, D

“…The largest prime factor of $X^3+2$ has been investigated by Hooley, who gave a conditional proof that it is infinitely often at least as large as $X^{1+\delta}$, with a certain positive constant $\delta$. …”

The largest prime factor of X-3+2 by Heath-Brown, D

The largest prime factor of the integers in an interval, II by Heath-Brown, D, Jia, C

A Simple Algorithm for Prime Factorization and Primality Testing by Kabenge Hamiss

Get full text

A binary access control method using prime factorization / by 324333 Chin-Chen Chang, Lou, Der-Chyuan

Experimenting with D-Wave quantum annealers on prime factorization problems by Jingwen Ding, Giuseppe Spallitta, Roberto Sebastiani

Subjects: Get full text

On a thin set of integers involving the largest prime factor function by Jean-Marie De Koninck, Nicolas Doyon

“…For each integer n≥2, let P(n) denote its largest prime factor. Let S:={n≥2:n does not divide P(n)!} and S(x):=#{n≤x:n∈S}. …”
Get full text

New Semi-Prime Factorization and Application in Large RSA Key Attacks by Anthony Overmars, Sitalakshmi Venkatraman

“…Semi-prime factorization is an increasingly important number theoretic problem, since it is computationally intractable. …”
Get full text

On the largest prime factor of quartic polynomial values: the cyclic and dihedral cases by Dartyge, C, Maynard, J

“…We prove that there exists a constant <em>c</em>_<em>P</em> &gt; 0 such that for a positive proportion of integers <em>n</em>, <em>P</em>(<em>n</em>) has a prime factor ≥ <em>n</em>^{1+<em>c</em>_<em>P</em>}.…”

3-tuples have at most 7 prime factors infinitely often by Maynard, J

3-tuples have at most 7 prime factors infinitely often by Maynard, J

“…We show there are infinitely many n for which the product L1(n)L2(n)L3(n) has at most 7 prime factors, improving a result of Porter from 1972. …”

Effective prime factorization via quantum annealing by modular locally-structured embedding by Jingwen Ding, Giuseppe Spallitta, Roberto Sebastiani

“…Abstract This paper investigates novel techniques to solve prime factorization by quantum annealing (QA). First, we present a very-compact modular encoding of a multiplier circuit into the architecture of current D-Wave QA devices. …”
Get full text