Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes
From MaRDI portal
Publication:2945397
Recommendations
- DPA Resilience of Rotation-Symmetric S-boxes
- On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
- Information Security and Cryptology - ICISC 2005
- Fast Software Encryption
- Trade-Offs for S-Boxes: Cryptographic Properties and Side-Channel Resilience
- An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
- Resistance of balanced s-boxes to linear and differential cryptanalysis
- Decomposed S-boxes and DPA attacks: a quantitative case study using PRINCE
Cited in
(13)- On the confusion coefficient of Boolean functions
- On the Importance of the Number of Fanouts to Prevent the Glitches in DPA-Resistant Devices
- Transparency order for Boolean functions: analysis and construction
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
- Further research results on confusion coefficient of Boolean functions
- On the construction of hardware-friendly \(4\times4\) and \(5\times5\) S-boxes
- Trade-Offs for S-Boxes: Cryptographic Properties and Side-Channel Resilience
- DPA Resilience of Rotation-Symmetric S-boxes
- Redefining the transparency order
- Results on symmetric S-boxes constructed by concatenation of RSSBs
- Hadamard matrices, \(d\)-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights
- A theoretical study of Kolmogorov-Smirnov distinguishers
This page was built for publication: Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945397)