[Resource Topic] 2021/1615: High-order Polynomial Comparison and Masking Lattice-based Encryption

Welcome to the resource topic for 2021/1615

High-order Polynomial Comparison and Masking Lattice-based Encryption

Authors: Jean-Sébastien Coron, François Gérard, Simon Montoya, Rina Zeitoun


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 finalists Kyber and Saber, with a concrete implementation.

ePrint: https://eprint.iacr.org/2021/1615

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .