On completely factoring any integer efficiently in a single run of an order finding algorithm

07/20/2020
by   Martin Ekerå, et al.
0

We show that given the order of a single element selected uniformly at random from ℤ_N^*, we can with very high probability, and for any integer N, efficiently find the complete factorization of N in polynomial time. This implies that a single run of the quantum part of Shor's factoring algorithm is usually sufficient. All prime factors of N can then be recovered with negligible computational cost in a classical post-processing step. The classical algorithm required for this step is essentially due to Miller.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2022

On the success probability of quantum order finding

We prove a lower bound on the probability of Shor's order-finding algori...
research
02/23/2018

Deterministic factoring with oracles

We revisit the problem of integer factorization with number-theoretic or...
research
09/04/2023

On the success probability of the quantum algorithm for the short DLP

Ekerå and Håstad have introduced a variation of Shor's algorithm for the...
research
08/12/2023

An Efficient Quantum Factoring Algorithm

We show that n-bit integers can be factorized by independently running a...
research
04/23/2021

An integer factorization algorithm which uses diffusion as a computational engine

In this article we develop an algorithm which computes a divisor of an i...
research
11/11/2021

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

The discrete logarithm problem (DLP) is the basis for several cryptograp...
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...

Please sign up or login with your details

Forgot password? Click here to reset