MOE: Multiplication Operated Encryption with Trojan Resilience

  • Olivier Bronchain Crypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, Belgium
  • Sebastian Faust Chair of Applied Cryptography, TU Darmstadt, Darmstadt, Germany
  • Virginie Lallemand Université de Lorraine, CNRS, Inria, LORIA, Nancy, France; Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
  • Gregor Leander Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
  • Léo Perrin Inria, Paris, France
  • François-Xavier Standaert Crypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, Belgium
Keywords: symmetric encryption, modular multiplication, Trojan-resilience

Abstract

In order to lower costs, the fabrication of Integrated Circuits (ICs) is increasingly delegated to offshore contract foundries, making them exposed to malicious modifications, known as hardware Trojans. Recent works have demonstrated that a strong form of Trojan-resilience can be obtained from untrusted chips by exploiting secret sharing and Multi-Party Computation (MPC), yet with significant cost overheads. In this paper, we study the possibility of building a symmetric cipher enabling similar guarantees in a more efficient manner. To reach this goal, we exploit a simple round structure mixing a modular multiplication and a multiplication with a binary matrix. Besides being motivated as a new block cipher design for Trojan resilience, our research also exposes the cryptographic properties of the modular multiplication, which is of independent interest.

Published
2021-03-19
How to Cite
Bronchain, O., Faust, S., Lallemand, V., Leander, G., Perrin, L., & Standaert, F.-X. (2021). MOE: Multiplication Operated Encryption with Trojan Resilience. IACR Transactions on Symmetric Cryptology, 2021(1), 78-129. https://doi.org/10.46586/tosc.v2021.i1.78-129
Section
Articles