The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A Survey of Fast Exponentiation Methods
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 516
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
Self-citationComputing Sequences with Addition Chains
Downey, P. J., Leong, B. L., & Sethi, R. (1981) · SIAM Journal on Computing · doi:10.1137/0210047 · Cited by 164
Proceedings 42nd IEEE Symposium on Foundations of Computer Science
(2001) · doi:10.1109/clustr.2001 · Cited by 162
Bos, J., & Coster, M. J. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_37 · Cited by 149
Yao, A. C.-C. (1976) · SIAM Journal on Computing · doi:10.1137/0205008 · Cited by 143
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 113
Efficient exponentiation using precomputation and vector addition chains
de Rooij, P. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053453 · Cited by 99
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
Meier, W., & Staffelbach, O. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_24 · Cited by 69
Detecting perfect powers in essentially linear time
Bernstein, D. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00952-1 · Cited by 59
Olivos, J. (1981) · Journal of Algorithms · doi:10.1016/0196-6774(81)90003-1 · Cited by 54
New Modular Multiplication Algorithms for Fast Modular Exponentiation
Hong, S., Oh, S.-Y., & Yoon, H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_15 · Cited by 41
Cited by
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
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Last-Level Cache Side-Channel Attacks are Practical
Liu, F., Yarom, Y., Ge, Q., Heiser, G., & Lee, R. B. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.43 · Cited by 1,009
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
Coron, J.-S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_25 · Cited by 965
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
Metadata
- Authors
- Gordon, D. M.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 1998-04
- Volume
- 27
- Issue
- 1
- Pages
- 129-146
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2099317248
- Cited by
- 534
- References
- 21
- FWCI
- 50.55
- 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
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.