Extending Randomness-Free First-Order Masking Schemes and Applications to Masking-Friendly S-boxes

Abstract: Masking has emerged as a widely adopted countermeasure against side-channel attacks. However, the implementation of masking schemes faces several challenges, including hardware area, latency and the overhead associated with fresh randomness generation. To eliminate the implementation cost caused by fresh randomness, Shahmirzadi et al. introduced a methodology for constructing 2-share first-order masking schemes without randomness at CHES 2021. In this work, we extend Shahmirzadi et al.’s method to find masked implementations for more S-boxes and further reduce the hardware overhead. We propose the concept of a non-linear compression layer, a comprehensive share assignment strategy based on a linear compression layer, and corresponding optimization techniques. Based on these techniques, we construct the first randomness-free first-order masking schemes for the PRINCE S-box and its inverse, reduce the hardware overhead of masking schemes for multiple S-boxes, and design new masking-f.... https://ojs.ub.rub.de/index.php/TCHES/article/view/11932

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Extending Randomness-Free First-Order Masking Schemes and Applications to Masking-Friendly S-boxes ; volume:2025 ; number:1 ; year:2024 ; IACR transactions on cryptographic hardware and embedded systems ; 2025, Heft 1 (2024)

Contributors, Places and Time

• Creator: Wu, Lixuan ; Fan, Yanhong ; Wang, Weijia ; Preneel, Bart ; Wang, Meiqin

Further information

• DOI: 10.46586/tches.v2025.i1.340-366
• URN: urn:nbn:de:101:1-2412181756120.051486328646
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:32 AM CEST