A Riddle Wrapped in an Enigma
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
In August 2015, the NSA released a major policy statement on the need for postquantum cryptography (PQC). This announcement will be a great stimulus to the development, standardization, and commercialization of new quantum-safe algorithms. However, certain peculiarities in the statement's wording and timing have given rise to much speculation concerning the NSA, elliptic curve cryptography, and quantum-safe cryptography. In this article, the authors evaluate some of the theories that have been proposed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299 · cited 2×
“Several companies have marketed QKD devices (see [20] ).”
BackgroundQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 1×
“The most mature lattice-based public-key encryption scheme is NTRU [27], which has been standardized in several forums [2, 29, 51].”
Cited by
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
“Although some researchers have speculated on the real reasons behind such an NSA announcement [37], long-term public-key cryptography seems to be threatened and developers need to prepare current blockchains for the post-quantum era.”
BackgroundThe impact of quantum computing on present cryptography
Mavroeidis, V., Vishi, K., D., M., & Jøsang, A. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090354 · Cited by 361
“Furthermore, the National Security Agency (NSA) has already announced plans to migrate their cryptographic standards to post-quantum cryptography [23].”
BackgroundA Review on Blockchain Technologies for an Advanced and Cyber-Resilient Automotive Industry
Fraga-Lamas, P., & Fernandez-Carames, T. M. (2019) · IEEE Access · doi:10.1109/access.2019.2895302 · Cited by 343
Fernandez-Carames, T. M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958788 · Cited by 317
Metadata
- Authors
- Koblitz, N., & Menezes, A.
- Venue
- IEEE Security & Privacy
- Published
- 2016-11
- Volume
- 14
- Issue
- 6
- Pages
- 34-42
- ISSN
- 1540-7993 (ISSN-L)
- OpenAlex
- W2294438196
- Cited by
- 46
- References
- 4
- FWCI
- 13.38
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Riddle Wrapped in an Enigma. https://app.cochat.ai/papers/10.1109/msp.2016.120
- The paper
- Koblitz, N., & Menezes, A. (2016). A Riddle Wrapped in an Enigma. IEEE Security & Privacy. https://doi.org/10.1109/msp.2016.120
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.