The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
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
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 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 2×
“This scheme is analogous to El-Gamal encryption [8].”
MethodKoblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
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
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
(2007) · Brute Force · doi:10.1007/0-387-27160-0_3 · Cited by 934
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
A Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Wrench, J. W. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0400642-2 · Cited by 482
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Knuth, D. E. (1978) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 369
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
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
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart Cards
Quisquater, J.-J., & Samyde, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45418-7_17 · Cited by 1,077
Introduction to differential power analysis
Kocher, P., Jaffe, J., Jun, B., & Rohatgi, P. (2011) · Journal of Cryptographic Engineering · doi:10.1007/s13389-011-0006-y · Cited by 632
The Montgomery Powering Ladder
Joye, M., & Yen, S.-M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_22 · Cited by 496
Faster Addition and Doubling on Elliptic Curves
Bernstein, D. J., & Lange, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_3 · Cited by 442
Metadata
- Authors
- Coron, J.-S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 292-302
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1565369953
- Cited by
- 965
- References
- 15
- FWCI
- 9.90
- 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
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.