Low Randomness Masking and Shuffling: An Evaluation Using Mutual Information
Author:
Open Access
- 16 August 2018
- journal article
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- p. 524-546
Abstract
Side-channel countermeasure designers often face severe performance overheads when trying to protect a device. Widely applied countermeasures such as masking and shuffling entail generating a large amount of random numbers, which can result in a computational bottleneck. To mitigate the randomness cost, this work evaluates low-randomness versions of both masking and shuffling, namely Recycled Randomness Masking (RRM) and Reduced Randomness Shuffling (RRS). These countermeasures employ memory units to store generated random numbers and reuse them in subsequent computations,making them primarily suitable for implementation on devices with sufficient memory. Both RRM and RRS are evaluated using the MI-based framework in the context of horizontal attacks. The evaluation exhibits the tradeoff between the randomness cost and the noisy leakage security level offered by the countermeasures, enabling the designer to fine-tune a masking or shuffling scheme and maximize the security level achieved for a certain cost.Keywords
This publication has 6 references indexed in Scilit:
- Formal Verification of Side-Channel Countermeasures via Elementary Circuit Transformations2018
- Masking Proofs Are Tight and How to Exploit it in Security Evaluations2018
- Amortizing Randomness Complexity in Private Circuits2017
- Changing of the Guards: A Simple and Efficient Method for Achieving Uniformity in Threshold Sharing2017
- How Fast Can Higher-Order Masking Be in Software?2017
- Masking vs. multiparty computation: how large is the gap for AES?Journal of Cryptographic Engineering, 2014