High-order Polynomial Comparison and Masking Lattice-based Encryption
Keywords:High-order masking, lattice-based encryption
The main protection against side-channel attacks consists in computing every function with multiple shares via the masking countermeasure. For IND-CCA secure lattice-based encryption schemes, the masking of the decryption algorithm requires the high-order computation of a polynomial comparison. In this paper, we describe and evaluate a number of different techniques for such high-order comparison, always with a security proof in the ISW probing model. As an application, we describe the full high-order masking of the NIST standard Kyber, with a concrete implementation on ARM Cortex M architecture, and a t-test evaluation.
How to Cite
Copyright (c) 2022 Jean-Sébastien Coron, François Gérard, Simon Montoya, Rina Zeitoun
This work is licensed under a Creative Commons Attribution 4.0 International License.