High-order Table-based Conversion Algorithms and Masking Lattice-based Encryption
Keywords:High-order masking, lattice-based cryptography, conversion algorithms
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.
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.