The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
More Flexible Exponentiation with Precomputation
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
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
A 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
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
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Okamoto, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_3 · Cited by 581
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
Computing Sequences with Addition Chains
Downey, P. J., Leong, B. L., & Sethi, R. (1981) · SIAM Journal on Computing · doi:10.1137/0210047 · Cited by 164
Bos, J., & Coster, M. J. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_37 · Cited by 149
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
Brickell, E. F., & McCurley, K. S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_6 · Cited by 94
Minimum weight modified signed-digit representations and fast exponentiation
Jedwab, J., & Mitchell, C. J. (1989) · Electronics Letters · doi:10.1049/el:19890785 · Cited by 84
Discrete Logarithms and Factoring
Bach, E. (1984) · UC Berkeley · Cited by 77
An interactive identification scheme based on discrete logarithms and factoring
Brickell, E. F., & McCurley, K. S. (1992) · Journal of Cryptology · doi:10.1007/bf00191319 · Cited by 62
An improved binary algorithm for RSA
Zhang, C. N. (1993) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(93)90295-7 · Cited by 30
Cited by
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
High-speed high-security signatures
Bernstein, D. J., Duif, N., Lange, T., Schwabe, P., & Yang, B.-Y. (2012) · Journal of Cryptographic Engineering · doi:10.1007/s13389-012-0027-1 · Cited by 541
A Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Metadata
- Authors
- Lim, C. H., & Lee, P. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-09
- Pages
- 95-107
- OpenAlex
- W1575893707
- Cited by
- 264
- References
- 15
- FWCI
- 13.09
- 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.