The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Hankerson, D., López Hernandez, J., & Menezes, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_1 · Cited by 423
Self-citationEfficient Arithmetic on Koblitz Curves
Solinas, J. A. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008306223194 · Cited by 344
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
Cohen, H., Miyaji, A., & Ono, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49649-1_6 · Cited by 296
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
Self-citationCurve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Efficient and robust pseudonymous authentication in VANET
Calandriello, G., Papadimitratos, P., Hubaux, J.-P., & Lioy, A. (2007) · Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks · doi:10.1145/1287748.1287752 · Cited by 543
The advantages of elliptic curve cryptography for wireless security
Lauter, K. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1269719 · Cited by 379
Metadata
- Authors
- Brown, M., Hankerson, D., López, J., & Menezes, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 250-265
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1523099545
- Cited by
- 258
- References
- 18
- FWCI
- 9.10
- Type
- conference paper
- 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: Software Implementation of the NIST Elliptic Curves Over Prime Fields. https://app.cochat.ai/papers/10.1007/3-540-45353-9_19
- The paper
- Brown, M., Hankerson, D., López, J., & Menezes, A. (2001). Software Implementation of the NIST Elliptic Curves Over Prime Fields. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45353-9_19
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.
