Higher-Order Masked Saber

• Published in: Security and Cryptography for Networks pp. 93 - 116
• Main Authors: Kundu, Suparna, D’Anvers, Jan-Pieter, Van Beirendonck, Michiel, Karmakar, Angshuman, Verbauwhede, Ingrid
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2022
• Series: Lecture Notes in Computer Science
• Subjects: Higher-order masking; Key-encapsulation mechanism; Post-quantum cryptography; Saber
• ISBN: 9783031147906; 3031147901
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-031-14791-3_5

Side-channel attacks are formidable threats to the cryptosystems deployed in the real world. An effective and provably secure countermeasure against side-channel attacks is masking. In this work, we present a detailed study of higher-order masking techniques for the key-encapsulation mechanism Saber. Saber is one of the lattice-based finalist candidates in the National Institute of Standards of Technology’s post-quantum standardization procedure. We provide a detailed analysis of different masking algorithms proposed for Saber in the recent past and propose an optimized implementation of higher-order masked Saber. Our proposed techniques for first-, second-, and third-order masked Saber have performance overheads of 2.7x, 5x, and 7.7x respectively compared to the unmasked Saber. We show that compared to Kyber which is another lattice-based finalist scheme, Saber’s performance degrades less with an increase in the order of masking. We also show that higher-order masked Saber needs fewer random bytes than higher-order masked Kyber. Additionally, we adapt our masked implementation to uSaber, a variant of Saber that was specifically designed to allow an efficient masked implementation. We present the first masked implementation of uSaber, showing that it indeed outperforms masked Saber by at least 12% for any order. We provide optimized implementations of all our proposed masking schemes on ARM Cortex-M4 microcontrollers.