DPA Attacks and S-Boxes
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
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
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · cited 2×
“The notion of derivative is related to differential and higher-order differential attacks [2, 13, 17].”
BackgroundLinear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 2×
“Cryptographic functions used in block ciphers must have high nonlinearities to prevent linear attacks (see [19]).”
BackgroundCorrelation 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 · cited 5×
“Specific methods for analyzing the power consumption measurements to find secret keys from tamper-resistant devices have been studied in [3, 15, 23].”
BackgroundMethodInfluentialExamining 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 · cited 1×
“Single-bit DPA attacks were generalized in multi-bit DPA attacks in [3,21,22,24, 27].”
Background(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Towards Sound Approaches to Counteract Power-Analysis Attacks
Chari, S. T., Jutla, C. S., Rao, J. R., & Rohatgi, P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_26 · Cited by 1,126 · cited 1×
“Since Kocher’s original paper, a large number of very efficient attacks has been reported on a wide variety of cryptographic implementations (see for instance [4,5,8,11,20,23]).”
Background
Cited by
A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework
Whitnall, C., & Oswald, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_18 · Cited by 283
A New 1D Chaotic Map and $\beta$ -Hill Climbing for Generating Substitution-Boxes
Alzaidi, A. A., Ahmad, M., Doja, M. N., Solami, E. A., & Beg, M. M. S. (2018) · IEEE Access · doi:10.1109/access.2018.2871557 · Cited by 108
Metadata
- Authors
- Prouff, E.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 424-441
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1595334710
- Cited by
- 164
- References
- 27
- FWCI
- 2.86
- 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.