CoChat
Sign Up
Cited by 8,515Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureSemiconductor Quantum Structures and Devices

Quantum cryptography

Open access
Gisin, Nicolas, Ribordy, Grégoire, Tittel, Wolfgang, Zbinden, Hugo·2002·Reviews of Modern Physics
DOI 10.1103/revmodphys.74.145
Open this paper in CoChat — free accountOpen PDF

Abstract

Quantum cryptography could well be the first application of quantum mechanics at the single-quantum level. The rapid progress in both theory and experiment in recent years is reviewed, with emphasis on open questions and technological issues.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/revmodphys.74.145

Cites

182 of 182 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Quantum cryptography provides authentication and unbreakable encryption or unconditional security over traditional cryptographic methods by exploiting the principles of quantum mechanics, such as superposition and entanglement.

    “Quantum cryptography provides authentication and unbreakable encryption or unconditional security over traditional cryptographic methods by exploiting the principles of quantum mechanics, such as superposition and entanglement (Gisin et al., 2002; Mafu and Senekane, 2018).”

    From Quantum technology for development framework as a tool for science diplomacy (2023) · cites this paper as Gisin et al., 2002

    The Introduction identifies quantum phenomena, including entanglement, as foundations of quantum cryptography, and the Conclusions contrast properly implemented quantum cryptography with breakable classical systems. But “Error correction, privacy amplification, and quantum secret growing” says key distribution must incorporate an authentication scheme, while “Real security: Technology, cost, and complexity” cautions that implementation limits security. The source therefore does not support the unqualified claim that quantum cryptography itself provides authentication and unbreakable encryption. (LLM, conf=0.88)

    Experimental — accuracy not yet measured

  • Quantum communication through quantum cryptography could ensure that diplomatic dialogues remain confidential, fostering improved candid discussions and trust and strengthening international relations.

    “Quantum communication through quantum cryptography (Gisin et al., 2002; Mafu and Senekane, 2018) could ensure that diplomatic dialogues remain confidential, fostering improved candid discussions and trust and strengthening international relations.”

    From Quantum technology for development framework as a tool for science diplomacy (2023) · cites this paper as Gisin et al., 2002

    The discussion of quantum key distribution (section II.D.3; page unavailable) says that an unperturbed key can safely be used to encode messages, supporting the possibility of confidential communication. The paper does not address diplomatic dialogues or whether confidentiality would foster candor, trust, or stronger international relations. It also says key distribution requires authentication. (LLM, conf=0.86)

    Experimental — accuracy not yet measured

  • A pulsed-pump version of Franson interferometry uses time-bin entanglement.

    “A pulsed-pump version of Franson-interferometry uses so-called time-bin entanglement (Brendel et al., 1999;Marcikic et al., 2002;Gisin et al., 2002) (see Fig. 10).”

    From Multiphoton entanglement and interferometry (2012) · cites this paper as Gisin et al., 2002

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 26

  1. Bell, J. S., 1987, Speakable and Unspeakable in Quantum Me- chanics (Cambridge University, Cambridge, England)].
  2. Bennett, C. H., and G. Brassard, 1984, in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, (IEEE, New York), pp. 175-179.
  3. Bourennane, M., A. Karlsson, G. Bjo ¨rn, N. Gisin, and N. Cerf, 2001, ''Quantum key distribution using multilevel encoding: security analysis,'' preprint quant-ph/0106049. · arXiv
  4. Braginsky, V. B., and F. Y. Khalili, 1992, Quantum Measure- ment (Cambridge University, Cambridge, England).
  5. Brassard, G., 1988, Modern Cryptology: A Tutorial, Lecture Notes in Computer Science, Vol. 325 (Springer, New York).
  6. Brassard, G., C. Cre ´peau, D. Mayers, and L. Salvail, 1998, in Proceedings of Randomized Algorithms, Satellite Workshop of the 23rd International Symposium on Mathematical Foun- dations of Computer Science, Brno, Czech Republic, edited by R. Freivalds (Aachen University, Aachen, Germany), pp. 13-15.
  7. Brassard, G., and L. Salvail, 1994, in Advances in Cryptology- EUROCRYPT '93 Proceedings, Lecture Notes in Computer Science, Vol. 765, edited by T. Helleseth (Springer, New York), p. 410.
  8. Diffie, W., and M. E. Hellman, 1976, ''New directions in cryp- tography,'' IEEE Trans. Inf. Theory IT-22, 644-654.
  9. Gisin, N., R. Renner, and S. Wolf, 2000, Proceedings of the Third European Congress of Mathematics, Barcelona (Birkha ¨user, Basel) (in press).
  10. Gisin, N., and S. Wolf, 2000, Advances in Cryptology- Proceedings of Crypto 2000, Lecture Notes in Computer Sci- ence, Vol. 1880, edited by M. Bellare (Springer, New York), pp. 482-500.
  11. Hildebrand, E., 2001, Ph.D. thesis (Johann Wolfgang Goethe- Universita ¨t, Frankfurt am Main).
  12. Hughes, R., G. G. Luther, G. L. Morgan, and C. Simmons, 1996, in Advances in Cryptology-CRYPTO '96 Proceedings, Lecture Notes in Computer Science, Vol. 1109, edited by N. Koblitz (Springer, New York), pp. 329-342.
  13. Inamori, H., L. Rallan, and V. Vedral, 2000, ''Security of EPR- based quantum cryptography against incoherent symmetric attacks,'' preprint quant-ph/0103058. · arXiv
  14. Maurer, U. M., and S. Wolf, 1999, ''Unconditionally secure key agreement and intrinsic information,'' IEEE Trans. Inf. Theory 45, 499-514.
  15. Mayers, D., 1996b, Advances in Cryptology-Proceedings of Crypto'96, Lecture Notes in Computer Science, Vol. 1109, edited by N. Koblitz (Springer, New York), pp. 343-357.
  16. Mayers, D., 1998, ''Unconditional security in quantum cryptog- raphy,'' J. Assn. Comput. Mac. (in press).
  17. Mayers, D., and A. Yao, 1998, Proceedings of the 39th Annual Symposium on Foundations of Computer Science (IEEE Computer Society, Los Alamitos, California), p. 503.
  18. Neumann, E.-G., 1988, Single-Mode Fibers: Fundamentals, Springer Series in Optical Sciences, Vol. 57 (Springer, Berlin).
  19. Penrose, R., 1994, Shadows of the Mind (Oxford University, Oxford, England).
  20. Pitowsky, I., 1989, Ed. Quantum Probability-Quantum Logic, Lecture Notes in Physics, Vol. 321 (Springer, Berlin).
  21. Rarity, J. G., and P. R. Tapster, 1988, in Photons and Quantum Fluctuations, edited by E. R. Pike and H. Walther (Hilger, Bristol, England), pp. 122-150.
  22. Shor, P. W., 1994, Proceedings of the 35th Symposium on Foun- dations of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, California), pp. 124-134.
  23. Stallings, W., 1999, Cryptography and Network Security: Prin- ciples and Practices (Prentice Hall, Upper Saddle River, New Jersey).
  24. Walls, D. F., and G. J. Milburn, 1995, Eds., Quantum Optics (Springer, Berlin).
  25. Wigner, E. P., 1961, The Logic of Personal Knowledge: Essays Presented to Michael Polanyi on his Seventieth Birthday, 11 March 1961 (Routledge & Kegan Paul, London), pp. 231- 238.
  26. Zissis, G., and A. Larocca, 1978, in Handbook of Optics, ed- ited by W. G. Driscoll (McGraw-Hill, New York), Sec.

Cited by

Sorted by citations

Related

Authors
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H.
Affiliations
University of Geneva (CH)
ORCID
Venue
Reviews of Modern Physics
Publisher
American Physical Society (APS)
Published
2002-03-08
Volume
74
Issue
1
Pages
145-195
ISSN
  • 0034-6861 (ISSN-L)
  • 1539-0756
DOI
10.1103/revmodphys.74.145
OpenAlex
W3038067977
Cited by
8,515
References
178
Citations by year
2026: 374 · 2025: 510 · 2024: 455 · 2023: 439 · 2022: 408 · 2021: 428 · 2020: 447 · 2019: 453 · 2018: 385 · 2017: 348 · 2016: 380 · 2015: 341 · 2014: 363 · 2013: 338 · 2012: 360
FWCI
193.04
Type
journal article
Language
en
Open access
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
  • Reviews of Modern Physics (publishedVersion)
  • Archive ouverte UNIGE (University of Geneva) (publishedVersion, other-oa)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Archive ouverte UNIGE (University of Geneva) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • European Commission
  • Fonds De La Recherche Scientifique - FNRS
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Semiconductor Quantum Structures and Devices
Keywords
quantum cryptography, quantum key distribution, applications of quantum mechanics, open problems, quantum technologies

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review