Paper 2025/273
Clustering Approach for Higher-Order Deterministic Masking
Abstract
We present a novel scheme for securely computing the AND operation, without requiring additional online randomness. Building on the work of Nikova et al., our construction extends security beyond the first order while ensuring a uniform output distribution and resilience against glitches up to a specified threshold. This result addresses a longstanding open problem in side-channel-resistant masking schemes. Our approach is based on a new method of share clustering, inspired by finite affine geometry, enabling simultaneous consideration of both security and uniformity. Furthermore, we demonstrate how this clustering-based framework can be applied to higher-order protection of ciphers like Ascon under a fully deterministic masking regime. By eliminating the need for online randomness within the protected circuit, our work expands the practical scope of efficient and higher-order masking schemes for resource constraint applications.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Boolean maskingCryptographyFinite geometryMultiplication gadgetsSide-channel analysis
- Contact author(s)
-
v jahandideh @ cs ru nl
jan schoone @ ru nl
lejla @ cs ru nl - History
- 2025-02-18: approved
- 2025-02-18: received
- See all versions
- Short URL
- https://ia.cr/2025/273
- License
-
CC BY-SA
BibTeX
@misc{cryptoeprint:2025/273,
author = {Vahid Jahandideh and Jan Schoone and Lejla Batina},
title = {Clustering Approach for Higher-Order Deterministic Masking},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/273},
year = {2025},
url = {https://eprint.iacr.org/2025/273}
}