Skip to Main content Skip to Navigation
Journal articles

Hardware Private Circuits: From Trivial Composition to Full Verification

Abstract : The design of glitch-resistant higher-order masking schemes is an important challenge in cryptographic engineering. A recent work by Moos et al. (CHES 2019) showed that most published schemes (and all efficient ones) exhibit local or composability flaws at high security orders, leaving a critical gap in the literature on hardware masking. In this paper, we first extend the simulatability framework of Belaïd et al. (EUROCRYPT 2016) and prove that a compositional strategy that is correct without glitches remains valid with glitches. We then use this extended framework to prove the first masked gadgets that enable trivial composition with glitches at arbitrary orders. We show that the resulting "Hardware Private Circuits" approach the implementation efficiency of previous (flawed) schemes. We finally investigate how trivial composition can serve as a basis for a tool that allows verifying full masked hardware implementations (e.g., of complete block ciphers) at any security order from their HDL code. As side products, we improve the randomness complexity of the best published refreshing gadgets, show that some S-box representations allow latency reductions and confirm practical claims based on implementation results.
Complete list of metadata
Contributor : Benjamin Gregoire Connect in order to contact the contributor
Submitted on : Friday, February 5, 2021 - 6:07:07 PM
Last modification on : Tuesday, February 9, 2021 - 3:26:45 AM
Long-term archiving on: : Friday, May 7, 2021 - 8:29:00 AM


Files produced by the author(s)




Gaetan Cassiers, Benjamin Grégoire, Itamar Levi, Francois-Xavier Standaert. Hardware Private Circuits: From Trivial Composition to Full Verification. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2020, ⟨10.1109/tc.2020.3022979⟩. ⟨hal-03133227⟩



Les métriques sont temporairement indisponibles