Name
Abstract | ||
|---|---|---|
The concept of transparency order is a useful measure for the robustness of (n, m)-functions (cryptographic S-boxes as mappings from GF(2)(n) to GF(2)(m)) to multi-bit Differential Power Analysis (DPA). The recently redefined notion of transparency order (RTO), based on the cross-correlation coefficients, uses a very delicate assumption that the adversary has a priori knowledge about the so called pre-charged logic value (a constant register value set by a system) used in DPA-like attacks. Moreover, quite contradictorily, this constant value is used as a variable when maximizing RTO . To make the attack scenario more realistic, the notion of differential transparency order (DTO) is defined for (n, m)-functions, which can efficiently eliminate the impact posed by this pre-charged logic value. By considering (4, 4) S-boxes which are commonly used in the design of lightweight block ciphers, we deduce in the simulated scenario that the information leakage using DTO is usually larger compared to the standard indicator. Towards its practical applications, we illustrate that the correlation power analysis (CPA) based on the novel notion of DTO performs better than that uses the classical notion of RTO. This conclusion is confirmed in two cases, i.e. CPA against MARVIN and CPA against PRESENT-128. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-91356-4_8 | INFORMATION SECURITY (ISC 2021) |
Keywords | DocType | Volume |
(n, m)-functions, Transparency order, Differential transparency order, Auto-correlation, Cross-correlation | Conference | 13118 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Zhou | 1 | 378 | 66.97 |
| Yongzhuang Wei | 2 | 0 | 0.68 |
| Hailong Zhang | 3 | 11 | 7.76 |
| Luyang Li | 4 | 0 | 1.35 |
| Enes Pasalic | 5 | 362 | 42.34 |
| Wenling Wu | 6 | 0 | 0.34 |