The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Open accessOverview
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
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-citationElliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
Self-citationA Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation
López, J., & Dahab, R. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_27 · Cited by 482
Efficient Arithmetic on Koblitz Curves
Solinas, J. A. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008306223194 · Cited by 344
Constructive and destructive facets of Weil descent on elliptic curves
Gaudry, P., Hess, F., & Smart, N. P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0011-x · Cited by 300
Montgomery Multiplication in GF(2k)
Koc, C. K., & Acar, T. (1998) · Designs, Codes and Cryptography · doi:10.1023/a:1008208521515 · Cited by 266
More Flexible Exponentiation with Precomputation
Lim, C. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_11 · Cited by 264
Speeding up the computations on an elliptic curve using addition-subtraction chains
Morain, F., & Olivos, J. (1990) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/1990240605311 · Cited by 258
Fast Exponentiation with Precomputation
Brickell, E. F., Gordon, D. M., McCurley, K. S., & Wilson, D. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47555-9_18 · Cited by 236
Fast Key Exchange with Elliptic Curve Systems
Schroeppel, R., Orman, H., O’Malley, S., & Spatscheck, O. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_4 · Cited by 231
Efficient algorithms for elliptic curve cryptosystems
Guajardo, J., & Paar, C. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052247 · Cited by 157
Efficient elliptic curve exponentiation
Miyaji, A., Ono, T., & Cohen, H. (1997) · Lecture notes in computer science · doi:10.1007/bfb0028484 · Cited by 115
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
Koyama, K., & Tsuruoka, Y. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_25 · Cited by 115
Elliptic Scalar Multiplication Using Point Halving
Knudsen, E. W. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48000-6_12 · Cited by 115
High-Speed Software Multiplication in F2m
López, J., & Dahab, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44495-5_18 · Cited by 113
Pgp in constrained wireless devices
Brown, M., Cheung, D., Hankerson, D., Hernandez, J. L., Kirkup, M., & Menezes, A. (2000) · Cited by 107
Self-citationOn the performance of signature schemes based on elliptic curves
Win, E. D., Mister, S., Preneel, B., & Wiener, M. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054867 · Cited by 97
A Cryptographic Application of Weil Descent
Galbraith⋆, S. D., & Smart, N. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46665-7_23 · Cited by 80
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
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
Malan, D. J., Welsh, M., & Smith, M. D. (2005) · 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. · doi:10.1109/sahcn.2004.1381904 · Cited by 712
Galbraith, S. D., Harrison, K., & Soldera, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45455-1_26 · Cited by 566
Metadata
- Authors
- Hankerson, D., López Hernandez, J., & Menezes, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 1-24
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1860992226
- Cited by
- 423
- References
- 27
- FWCI
- 23.36
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.