Paper 2024/925

Time Sharing - A Novel Approach to Low-Latency Masking

Dilip Kumar S. V., KU Leuven
Siemen Dhooghe, KU Leuven
Josep Balasch, KU Leuven
Benedikt Gierlichs, KU Leuven
Ingrid Verbauwhede, KU Leuven
Abstract

We present a novel approach to small area and low-latency first-order masking in hardware. The core idea is to separate the processing of shares in time in order to achieve non-completeness. Resulting circuits are proven first-order glitch-extended PINI secure. This means the method can be straightforwardly applied to mask arbitrary functions without constraints which the designer must take care of. Furthermore we show that an implementation can benefit from optimization through EDA tools without sacrificing security. We provide concrete results of several case studies. Our low-latency implementation of a complete PRINCE core shows a 32% area improvement (44% with optimization) over the state-of-the-art. Our PRINCE S-Box passes formal verification with a tool and the complete core on FPGA shows no first-order leakage in TVLA with 100 million traces. Our low-latency implementation of the AES S-Box costs roughly one third (one quarter with optimization) of the area of state-of-the-art implementations. It shows no first-order leakage in TVLA with 250 million traces.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published by the IACR in TCHES 2024
Keywords
HardwareMaskingProbing SecuritySide-Channel Analysis
Contact author(s)
dshanmug @ esat kuleuven be
siemen dhooghe @ esat kuleuven be
josep balasch @ esat kuleuven be
benedikt gierlichs @ esat kuleuven be
ingrid verbauwhede @ esat kuleuven be
History
2024-06-12: approved
2024-06-10: received
See all versions
Short URL
https://ia.cr/2024/925
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/925,
      author = {Dilip Kumar S. V. and Siemen Dhooghe and Josep Balasch and Benedikt Gierlichs and Ingrid Verbauwhede},
      title = {Time Sharing - A Novel Approach to Low-Latency Masking},
      howpublished = {Cryptology ePrint Archive, Paper 2024/925},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/925}},
      url = {https://eprint.iacr.org/2024/925}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.