Abstract
This paper gives algorithms for the discrete log and the factoring problems that take random polynomial time on a quantum computer.
Cite
CITATION STYLE
APA
Shor W. Peter. (1992). Algorithms for Quantum Computation: Discrete Log and Factoring.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free