Abstract
The most famous classical factorization algorithms are the Quadratic Sieve (QS) and the Number Field Sieve (NFS). Though being subexponential, they are not polynomial. The QS is the fastest general-purpose factorization algorithm for numbers with less than 110 digits, whereas the NFS has the same property for numbers with more than 110 digits (see Schneier (1996), p.256).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neuenschwander, D. (2004). 3 Factorization with Quantum Computers: Shor’s Algorithm. In: Probabilistic and Statistical Methods in Cryptology. Lecture Notes in Computer Science, vol 3028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25942-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-25942-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22001-5
Online ISBN: 978-3-540-25942-8
eBook Packages: Springer Book Archive