The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Differential Power Analysis
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Self-citationDifferential 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
Differential Cryptanalysis of the Data Encryption Standard
Biham, E., & Shamir, A. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9314-6 · Cited by 1,054
Tamper resistance: a cautionary note
Anderson, R., & Kühn, M. (1996) · Cited by 1,048
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
A Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
Daemen, J., Knudsen, L. R., & Rijmen, V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052343 · Cited by 741
Low cost attacks on tamper resistant devices
Anderson, R., & Kuhn, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028165 · Cited by 582
Strong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532
Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471 · Cited by 504
The First Experimental Cryptanalysis of the Data Encryption Standard
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_1 · Cited by 416
Incremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
More Flexible Exponentiation with Precomputation
Lim, C. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_11 · Cited by 264
Proactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266442 · Cited by 253
Optimal-resilience proactive public-key cryptosystems
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646127 · Cited by 217
Cryptography: A new dimension in computer data security
Bookstein, A. (1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90072-x · Cited by 213
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052254 · Cited by 168
Zoreda, J. M., & Otón, J. M. (1994) · Cited by 142
Tiger: A fast new hash function
Anderson, R., & Biham, E. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_46 · Cited by 103
Naccache, D., & M’Raïhi, D. (1996) · IEEE Micro · doi:10.1109/40.502402 · Cited by 100
Efficient exponentiation using precomputation and vector addition chains
de Rooij, P. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053453 · Cited by 99
An algorithm for modular exponentiation
Dimitrov, V. S., JULLIEN, G. A., & Miller, W. C. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00044-1 · Cited by 87
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
New Modular Multiplication Algorithms for Fast Modular Exponentiation
Hong, S., Oh, S.-Y., & Yoon, H. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_15 · Cited by 41
A Provably-Secure Strongly-Randomized Cipher
Maurer, U. M. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_33 · Cited by 40
Analysis of Certain Aspects of Output Feedback Mode
Jueneman, R. R. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_10 · Cited by 25
Redundant Integer Representations and Fast Exponentiation
Gollmann, D., Han, Y., & Mitchell, C. J. (1996) · Designs Codes and Cryptography · doi:10.1007/bf00125080 · Cited by 22
A 533-MHz BiCMOS superscalar RISC microprocessor
(1997) · doi:10.1109/4.641683 · Cited by 16
Smart Card a Highly Reliable and Portable Security Device
Guillou, L. C., & Ugon, M. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_35 · Cited by 12
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Correlation Power Analysis with a Leakage Model
Brier, E., Clavier, C., & Olivier, F. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_2 · Cited by 2,544
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
Spectre Attacks: Exploiting Speculative Execution
Kocher, P., Genkin, D., Gruss, D., Haas, W., Hamburg, M., Lipp, M., Mangard, S., Prescher, T., Schwarz, M., & Yarom, Y. (2018) · arXiv · doi:10.48550/arxiv.1801.01203 · Cited by 1,850
Self-citationExamining 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
Metadata
- Authors
- Kocher, P., Jaffe, J., & Jun, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 388-397
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2154909745
- Cited by
- 7,407
- References
- 36
- FWCI
- 36.22
- 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.