High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption

Authors

  • Jean-Sébastien Coron University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • François Gérard University of Luxembourg, Esch-sur-Alzette, Luxembourg
  • Simon Montoya IDEMIA, Cryptography & Security Labs, Courbevoie, France; LIX, INRIA, CNRS, École Polytechnique, Institut Polytechnique de Paris, France
  • Rina Zeitoun IDEMIA, Cryptography & Security Labs, Courbevoie, France

DOI:

https://doi.org/10.46586/tches.v2022.i2.1-40

Keywords:

High-order masking, lattice-based cryptography, conversion algorithms

Abstract

Masking is the main countermeasure against side-channel attacks on embedded devices. For cryptographic algorithms that combine Boolean and arithmetic masking, one must therefore convert between the two types of masking, without leaking additional information to the attacker. In this paper we describe a new high-order conversion algorithm between Boolean and arithmetic masking, based on table recomputation, and provably secure in the ISW probing model. We show that our technique is particularly efficient for masking structured LWE encryption schemes such as Kyber and Saber. In particular, for Kyber IND-CPA decryption, we obtain an order of magnitude improvement compared to existing techniques.

Downloads

Published

2022-02-15

Issue

Section

Articles

How to Cite

High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption. (2022). IACR Transactions on Cryptographic Hardware and Embedded Systems, 2022(2), 1-40. https://doi.org/10.46586/tches.v2022.i2.1-40