The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Differential Fault Attacks on Elliptic Curve Cryptosystems
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 Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Differential fault analysis of secret key cryptosystems
Biham, E., & Adi Shamir, Z. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052259 · Cited by 1,671
On the Importance of Checking Cryptographic Protocols for Faults
Boneh, D., DeMillo, R. A., & Lipton, R. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_4 · Cited by 1,496
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Tamper resistance: a cautionary note
Anderson, R., & Kühn, M. (1996) · Cited by 1,048
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Low cost attacks on tamper resistant devices
Anderson, R., & Kuhn, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028165 · Cited by 582
Design principles for tamper-resistant smartcard processors
Kömmerling, O., & Kühn, M. (1999) · Cited by 538
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052240 · Cited by 207
Cited by
Aitzhan, N. Z., & Svetinovic, D. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2616861 · Cited by 1,297
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures
Barenghi, A., Breveglieri, L., Koren, I., & Naccache, D. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188769 · Cited by 609
Elliptic Curve Cryptography in Practice
Bos, J. W., Halderman, J. A., Heninger, N., Moore, J., Naehrig, M., & Wustrow, E. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_11 · Cited by 321
Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures
Aumüller, C., Bier, P., Fischer, W., Hofreiter, P., & Seifert, J.-P. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_20 · Cited by 261
Dragonblood: Analyzing the Dragonfly Handshake of WPA3 and EAP-pwd
Vanhoef, M., & Ronen, E. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00031 · Cited by 179
Metadata
- Authors
- Biehl, I., Meyer, B., & Müller, V.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 131-146
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1935672779
- Cited by
- 323
- References
- 10
- FWCI
- 2.54
- 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.