Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Explore this paper's citation graph
- Type
- article
- Published
- 1999-01-01
- Cited by
- 3,833
- References
- 116
- OpenAlex
- https://openalex.org/W2137147061
Keywords
Quantum computer, Integer factorization, Discrete logarithm, Prime factor, Logarithm
References
- A silicon-based nuclear spin quantum computer
- Fast algorithms - a multitape Turing machine implementation
- Error Correction in Quantum Communication
- Multiplication of Multidigit Numbers on Automata
- Simulating quantum systems on a quantum computer
- Semiclassical Fourier transform for quantum computation.
- Maintaining coherence in quantum computers.
- Discrete Logarithms in GF(P) Using the Number Field Sieve
- A Potentially Realizable Quantum Computer
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
- Quantum Computation and Shor's Factoring Algorithm
- On the Power of Multiplication in Random Access Machines
- Parallel algorithms column 1: models of computation
- Efficient Simulation of Quantum Systems by Quantum Computers
- Two-bit gates are universal for quantum computation.
- Quantum complexity theory
- Envisioning a quantum supercomputer.
- A method for obtaining digital signatures and public-key cryptosystems
- Almost any quantum logic gate is universal.
- Scheme for reducing decoherence in quantum computer memory.
Cited by
- A Note on Shor's Quantum Algorithm for Prime Factorization
- Joint Interoperability: Fog or Lens for Joint Vision 2010?
- Discrete Quantum Markov Chains
- Quantum Automata: An Overview
- A light-based solution to the Subset-sum problem
- Quantum algorithms for state reconstruction
- Quantum Two Provers Interactive Proof Systems
- Nuevos algoritmos cuánticos para tomografía de procesos y estados
- Computational complexity in entanglement transformations
- Implementing Pure Adaptive Search with Grover's Quantum Algorithm
- A Quantum Phase Representation of Heisenberg Limits and a Minimally Resourced Quantum Phase Estimator
- A new trapdoor in modular knapsack public-key cryptosystem
- On the computational power of quantum computers
- Cryptanalyse algébrique : outils et applications
- Information quantique par passage adiabatique : portes quantiques et décohérence
- Quantum Search on Strongly Regular Graphs
- Degree of regularity for HFE Minus (HFE
- Nonlocality in multipartite correlation networks
- Quantum circuits for F2n[12pt]minimal amsmath wasysym amsfonts amssymb amsbsy mathrsfs upgreek -69pt documentF_2^ndocument-multipli
- Improved Identification Protocol Based on the MQ Problem
Related papers
- New public key encryption techniques based on generalized discrete logarithm, integer factorization and double integer factorization problems
- Research of New Public-key Cryptosystems Based on Combinatorial Group Theory
- Improved Shao's Signature Scheme
- Shor's discrete logarithm quantum algorithm for elliptic curves