On completely factoring any integer efficiently in a single run of an order-finding algorithm
From MaRDI portal
Publication:2690484
DOI10.1007/S11128-021-03069-1OpenAlexW3167726926MaRDI QIDQ2690484FDOQ2690484
Authors: Martin Ekerå 
Publication date: 17 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.10044
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Factorization (11Y05) Factorization; primality (11A51)
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Factoring polynomials with rational coefficients
- The discrete logarithm modulo a composite hides \(O(n)\) bits
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Title not available (Why is that?)
- Probability estimates for Shor's algorithm
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Title not available (Why is that?)
- Detecting perfect powers by factoring into coprimes
- Odd orders in Shor's factoring algorithm
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- On post-processing in the quantum algorithm for computing short discrete logarithms
- Improving the success probability for Shor's factorization algorithm
Cited In (1)
This page was built for publication: On completely factoring any integer efficiently in a single run of an order-finding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2690484)
