1. Hardware Private Circuits: From Trivial Composition to Full Verification
- Author
-
Itamar Levi, Gaëtan Cassiers, Benjamin Grégoire, François-Xavier Standaert, UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique, Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), Sûreté du logiciel et Preuves Mathématiques Formalisées (STAMP), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Gaetan Cassiers and Franc¸ois-Xavier Standaert are resp. Research Fellow and Senior Associate Researcher of the Belgian Fund for Scientific Research (FNRS-F.R.S.). This work has been funded in part by the ERC project 724725., and European Project: 724725,SWORD(2017)
- Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR] ,Computer science ,Cryptography ,02 engineering and technology ,masking countermeasure ,Theoretical Computer Science ,[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] ,Composability ,0202 electrical engineering, electronic engineering, information engineering ,Code (cryptography) ,composability ,Side channel attack ,Randomness ,Block cipher ,Sside-channel attacks ,Masking countermeasure ,Physical defaults ,Glitch-Based leakages ,Cryptographic engineering ,business.industry ,side-channel attacks ,020206 networking & telecommunications ,glitch-Based leakages ,020202 computer hardware & architecture ,physical defaults ,Computational Theory and Mathematics ,Hardware and Architecture ,Logic gate ,business ,Software ,Computer hardware - Abstract
International audience; 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.
- Published
- 2021
- Full Text
- View/download PDF