Abstract
Today, RSA cryptography is the last word in secure codes. Present-day computers are not fast enough to factor large numbers, and therefore cannot break RSA-encrypted messages. In the future, however, this situation may change. After hundreds of years of effort, no efficient factoring algorithm has been found, so the chance that such an algorithm exists seems slim. However, until it is proved that such an algorithm does not exist, the possibility that it exists and will some day be discovered, with disastrous results for RSA, cannot be ruled out. Another possibility is the development of a new type of computers (perhaps quantum computers, see http://www.qubit.org/), many orders of magnitude faster than today’s computers, that would be able to factor large numbers in reasonable time even with an inefficient factoring algorithm.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Salomon, D. (2003). Quantum Cryptography. In: Data Privacy and Security. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21707-9_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-21707-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1816-1
Online ISBN: 978-0-387-21707-9
eBook Packages: Springer Book Archive