The DOI matches its Crossref record; 2 of the 2 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.
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
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 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
Cited by
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
The advantages of elliptic curve cryptography for wireless security
Lauter, K. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1269719 · Cited by 379
Optimistic fair exchange of digital signatures: Extended abstract
Asokan, N., Shoup, V., & Waidner, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054156 · Cited by 305
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Brown, M., Hankerson, D., López, J., & Menezes, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_19 · Cited by 258
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
- 2
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: More Flexible Exponentiation with Precomputation. https://app.cochat.ai/papers/10.1007/3-540-48658-5_11
- The paper
- Lim, C. H., & Lee, P. J. (2007). More Flexible Exponentiation with Precomputation. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-48658-5_11
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.
