Cybersecurity in an Era with Quantum Computers: Will We Be Ready?
The DOI matches its Crossref record; 21 of the 23 references it cites were found in a registry or an index.
Abstract
Organizations must understand their specific risks and plan for their systems to be resilient to quantum attacks. Assessment is based on three quantities: the security shelf life of the information assets, the migration time to systems designed to resist quantum attacks, and the time remaining before quantum computers break the security.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“The threat from cryptographically relevant quantum computers (CRQCs) is no longer speculative.”
In the citing paper
“Mosca's well-known argument [44] frames the relevant security parameter: if X is the duration for which information must remain confidential, Y is the time required to migrate to PQC, and Z is the time until a CRQC is available, then any system with X + Y > Z is already at risk through the harvest-now-decrypt-later adversary, who records ciphertext today for future decryption.”
In the citing paper
“Mosca's argument [44] tells us that any system carrying information that must remain confidential beyond the CRQC arrival date is already under attack by A5 today.”
In the citing paper
“Mosca's harvestnow-decrypt-later argument [44] applies to ICS today”
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
The Structure of Scientific Revolutions
Kuhn, T. S. (1996) · doi:10.7208/chicago/9780226458106.001.0001 · Cited by 7,281
The Structure of Scientific Revolutions
(2017) · Macat Library eBooks · doi:10.4324/9781912281589 · Cited by 5,397
Superconducting Circuits for Quantum Information: An Outlook
Devoret, M. H., & Schoelkopf, R. J. (2013) · Science · doi:10.1126/science.1231930 · Cited by 2,114
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Weaknesses in the Key Scheduling Algorithm of RC4
Fluhrer, S., Mantin, I., & Shamir, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45537-x_1 · Cited by 1,043
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 916
(1996) · Cited by 824
Córcoles, A. D., Magesan, E., Srinivasan, S. J., Cross, A. W., Steffen, M., Gambetta, J. M., & Chow, J. M. (2015) · Nature Communications · doi:10.1038/ncomms7979 · Cited by 490
10-Qubit Entanglement and Parallel Logic Operations with a Superconducting Circuit
Song, C., Xu, K., Liu, W., Yang, C.-P., Zheng, S.-B., Deng, H., Xie, Q., Huang, K., Guo, Q., Zhang, L., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180511 · Cited by 449
Detecting bit-flip errors in a logical qubit using stabilizer measurements
Ristè, D., Poletto, S., Huang, M.-Z., Bruno, A., Vesterinen, V., Saira, O.-P., & DiCarlo, L. (2015) · Nature Communications · doi:10.1038/ncomms7983 · Cited by 262
Scalable Quantum Circuit and Control for a Superconducting Surface Code
Versluis, R., Poletto, S., Khammassi, N., Tarasinski, B., Haider, N., Michalak, D. J., Bruno, A., Bertels, K., & DiCarlo, L. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.034021 · Cited by 193
Multilayer microwave integrated quantum circuits for scalable quantum computing
Brecht, T., Pfaff, W., Wang, C., Chu, Y., Frunzio, L., Devoret, M. H., & Schoelkopf, R. J. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.2 · Cited by 191
Oversimplifying quantum factoring
Smolin, J. A., Smith, G., & Vargo, A. (2013) · Nature · doi:10.1038/nature12290 · Cited by 151
Quantum computing: An IBM perspective
Steffen, M., Divincenzo, D. P., Chow, J. M., Theis, T. N., & Ketchen, M. B. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2165678 · Cited by 96
Computing Logarithms in Finite Fields of Characteristic Two
Blake, I. F., Fuji‐Hara, R., Mullin, R. C., & Vanstone, S. A. (1984) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0605029 · Cited by 72
Tutte, W. T. (2000) · Springer eBooks · doi:10.1007/978-3-642-59663-6_2 · Cited by 26
A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys
Ioannou, L. M., & Mosca, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25405-5_17 · Cited by 15
Self-citationThermocompression bonding technology for multilayer superconducting quantum circuits
McRae, C. R., Béjanin, J. H., Pagel, Z., Abdallah, A. O., McConkey, T., Earnest, C. T., Rinehart, J. R., & Mariantoni, M. (2017) · Applied Physics Letters · doi:10.1063/1.5003169 · Cited by 13
(1998) · doi:10.1002/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-p
Research works printed but not linked: 3
- mcrae, 2017, IBM Builds Its Most Powerful Universal Quantum Computing Processors, IBM press release
- mosca, 0, Setting the Scene for the ETSI Quantum-Safe Cryptography Workshop;, Proceedings of 1st Quantum-Safe-Crypto Workshop
- mcrae, 0, NIST Workshop on Cybersecurity in a Post-Quantum World
Cited by
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
Blockchain platform for industrial healthcare: Vision and future opportunities
Farouk, A., Alahmadi, A., Ghose, S., & Mashatan, A. (2020) · Computer Communications · doi:10.1016/j.comcom.2020.02.058 · Cited by 335
Fernandez-Carames, T. M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958788 · Cited by 317
Metadata
- Authors
- Mosca, M.
- Affiliations
- University of Waterloo (CA)
- Corresponding author
- Mosca, Michele
- ORCID
- Mosca, Michele
- Venue
- IEEE Security & Privacy
- Published
- 2018-09
- Volume
- 16
- Issue
- 5
- Pages
- 38-41
- ISSN
- 1540-7993 (ISSN-L)
- 1558-4046
- OpenAlex
- W2587454507
- Cited by
- 581
- References
- 23
- Citations by year
- 2026: 194 · 2025: 118 · 2024: 66 · 2023: 56 · 2022: 43 · 2021: 38 · 2020: 45 · 2019: 13 · 2018: 3
- FWCI
- 13.93
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Security & Privacy (publishedVersion)
- Funders
- Government of Canada
- Instituto de Telecomunicações
- Institut Périmètre de physique théorique
- Natural Sciences and Engineering Research Council of Canada
- Office of Naval Research
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- post-quantum cryptography, quantum computing threats, cybersecurity risk assessment, quantum attacks
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.