Paper 2024/967
Consolidated Linear Masking (CLM): Generalized Randomized Isomorphic Representations, Powerful Degrees of Freedom and Low(er)-cost
Abstract
Masking is a widely adopted countermeasure against side-channel analysis (SCA) that protects cryptographic implementations from information leakage. However, current masking schemes often incur significant overhead in terms of electronic cost. RAMBAM, a recently proposed masking technique that fits elegantly with the AES algorithm, offers ultra-low latency/area by utilizing redundant representations of finite field elements. This paper presents a comprehensive generalization of RAMBAM and various other masking schemes within a unified framework and a mathematical representation known as Consolidated Linear Masking (CLM), where masking schemes are formalized by their encoding. We establish a theoretical foundation for CLM linking randomized isomorphic (code) representations and the entropy provided by the redundancy to a revised notion of masking order. Our analysis reveals that RAMBAM is a specific instance of CLM as well as other masking constructions, thus paving the way for significant enhancements. For example, a
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Algebraic representationConsolidated Linear MaskingCLMIsomorphismSide Channel AnalysisMaskingRAMBAMEntropy
- Contact author(s)
-
itamar levi @ biu ac il
osnat keren @ biu ac il - History
- 2024-07-08: revised
- 2024-06-15: received
- See all versions
- Short URL
- https://ia.cr/2024/967
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/967, author = {Itamar Levi and Osnat Keren}, title = {Consolidated Linear Masking ({CLM}): Generalized Randomized Isomorphic Representations, Powerful Degrees of Freedom and Low(er)-cost}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/967}, year = {2024}, url = {https://eprint.iacr.org/2024/967} }