The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Practical Implementation of the Timing Attack
Overview
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. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Applied Nonparametric Statistics
Wozniak, P. J., & Daniel, W. W. (1991) · Technometrics · doi:10.2307/1268795 · Cited by 4,987
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
Siegel, S. (1957) · The American Statistician · doi:10.1080/00031305.1957.10501091 · Cited by 3,903
Cited by
Examining smart-card security under the threat of power analysis attacks
Messerges, T. S., Dabbish, E. A., & Sloan, R. H. (2002) · IEEE Transactions on Computers · doi:10.1109/tc.2002.1004593 · Cited by 1,693
Remote timing attacks are practical
Brumley, D., & Boneh, D. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.01.010 · Cited by 871
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
Power Analysis Attacks of Modular Exponentiation in Smartcards
Messerges, T. S., Dabbish, E. A., & Sloan, R. H. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_14 · Cited by 330
Predicting Secret Keys Via Branch Prediction
Acıiçmez, O., Koç, Ç. K., & Seifert, J.-P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11967668_15 · Cited by 307
Metadata
- Authors
- Dhem, J.-F., Koeune, F., Leroux, P.-A., Mestré, P., Quisquater, J.-J., & Willems, J.-L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 167-182
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1811355673
- Cited by
- 277
- References
- 4
- FWCI
- 8.17
- 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.