Skip to main content

2018 | OriginalPaper | Buchkapitel

15. What Is Next in Cryptology?

verfasst von : John F. Dooley

Erschienen in: History of Cryptography and Cryptanalysis

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

What would happen if all of the algorithms in public-key cryptography suddenly could be broken in seconds or minutes? Those algorithms, like RSA and elliptic curve cryptography are the ones that we depend on for Internet commerce. What if they were all of a sudden useless? Would society collapse? Would commerce be at an end? That is the promise and the danger of quantum computers.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Remember Schrödinger’s cat. The cat in the closed box may either be dead or alive. Only when the box is opened do we know which state the cat is in. Qubits work the same way. Only when you observe (measure) them do you know what state they are in. Until that point there is the probability they are in any of the other possible states.
 
4
For a list of many quantum computing algorithms see https://​math.​nist.​gov/​quantum/​zoo/​
 
6
Wiesner did try to get a version of his idea with an application to quantum currency published, but his paper was rejected. He resurrected his ideas a decade later and was finally able to get them published. This is the starting point for the Bennett and Brassard research that led to their 1984 paper.
 
7
This is an admittedly over-simplified description of these physical concepts.
 
Literatur
Zurück zum Zitat Altepeter, Joseph B. 2010. A Tale of Two Qubits: How Quantum Computers Work. Ars Technica (Online Magazine), January 18, 2010. Altepeter, Joseph B. 2010. A Tale of Two Qubits: How Quantum Computers Work. Ars Technica (Online Magazine), January 18, 2010.
Zurück zum Zitat Bauer, Craig P. 2013. Secret History: The Story of Cryptology. Boca Raton: CRC Press.MATH Bauer, Craig P. 2013. Secret History: The Story of Cryptology. Boca Raton: CRC Press.MATH
Zurück zum Zitat Bernstein, Daniel. 2009. Introduction to Post-Quantum Cryptography. In Post-Quantum Cryptography, 1–14. Berlin: Springer-Verlag.CrossRef Bernstein, Daniel. 2009. Introduction to Post-Quantum Cryptography. In Post-Quantum Cryptography, 1–14. Berlin: Springer-Verlag.CrossRef
Zurück zum Zitat Bernstein, Daniel, Johannes Buckmann, and Erik Dahmen, eds. 2009. Post-Quantum Cryptography. Berlin: Springer-Verlag.MATH Bernstein, Daniel, Johannes Buckmann, and Erik Dahmen, eds. 2009. Post-Quantum Cryptography. Berlin: Springer-Verlag.MATH
Zurück zum Zitat Cesare, Chris. 2015. Encryption Faces Quantum Foe. Nature, September 9, 2015. Cesare, Chris. 2015. Encryption Faces Quantum Foe. Nature, September 9, 2015.
Zurück zum Zitat Hoffstein, Jeffrey, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A Ring Based Public Key Cryptosystem. In Lecture Notes in Computer Science 1423, 267–288. Portland: Springer-Verlag. Hoffstein, Jeffrey, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A Ring Based Public Key Cryptosystem. In Lecture Notes in Computer Science 1423, 267–288. Portland: Springer-Verlag.
Zurück zum Zitat Preskill, John. 1998. Robust Solutions to Hard Problems. Nature, February 12, 1998. Preskill, John. 1998. Robust Solutions to Hard Problems. Nature, February 12, 1998.
Zurück zum Zitat Proos, John, and Christof Zalka. 2003. Shor’s Discrete Logarithm Quantum Algorithm for Elliptic Curves. Quantum Information and Computation 3 (4): 317–344.MathSciNetMATH Proos, John, and Christof Zalka. 2003. Shor’s Discrete Logarithm Quantum Algorithm for Elliptic Curves. Quantum Information and Computation 3 (4): 317–344.MathSciNetMATH
Zurück zum Zitat Shor, Peter. 1994. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. Santa Fe: IEEE Computer Society Press. https://arxiv.org/abs/quant-ph/9508027v2. Shor, Peter. 1994. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. Santa Fe: IEEE Computer Society Press. https://​arxiv.​org/​abs/​quant-ph/​9508027v2.
Metadaten
Titel
What Is Next in Cryptology?
verfasst von
John F. Dooley
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-90443-6_15