On computing ord_N(2) and its application
DOI10.1016/J.IC.2006.04.003zbMATH Open1097.81017OpenAlexW2029779959MaRDI QIDQ2500476FDOQ2500476
Authors: Li Hua Liu, Zhengjun Cao 
Publication date: 16 August 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.04.003
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Factorization (11Y05)
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Factoring integers with elliptic curves
- Riemann's hypothesis and tests for primality
- Title not available (Why is that?)
- A monte carlo method for factorization
- Title not available (Why is that?)
Cited In (9)
- Odd orders in Shor's factoring algorithm
- Factorization
- Quantum factorization algorithm by NMR ensemble computers
- Probability estimates for Shor's algorithm
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Improving the success probability for Shor's factorization algorithm
- Quantum factoring algorithm: resource estimation and survey of experiments
- On completely factoring any integer efficiently in a single run of an order-finding algorithm
- A new quantum algorithm for computing RSA ciphertext period
Uses Software
This page was built for publication: On computing ord\(_{N}(2)\) and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500476)
