Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy
Open Access
Abstract
The bounds presented at CHES 2017 based on Massey’s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Massey-like inequality and then further refining it for finite support distributions. The impact of these results is highlighted for side-channel attack evaluations, demonstrating the improvements over the CHES 2017 bounds.Keywords
Funding Information
- Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii (PN-III-P1-1.1-TE-2019-2245)
This publication has 18 references indexed in Scilit:
- On the Conditional Smooth Rényi Entropy and its Applications in Guessing and Source CodingIEEE Transactions on Information Theory, 2019
- Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys2019
- Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi MeasuresIEEE Transactions on Information Theory, 2018
- Efficient, Portable Template AttacksIEEE Transactions on Information Forensics and Security, 2017
- Back to Massey: Impressively Fast, Scalable and Tight Security Evaluation Tools2017
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks2017
- Simple Key Enumeration (and Rank Estimation) Using Histograms: An Integrated Approach2016
- Simpler and More Efficient Rank Estimation for Side-Channel Security Assessment2015
- Constrained Search for a Class of Good Bijective $S$-Boxes With Improved DPA ResistivityIEEE Transactions on Information Forensics and Security, 2013
- An inequality on guessing and its application to sequential decodingIEEE Transactions on Information Theory, 1996