Paper 2023/517

Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography

Aikata Aikata, University of Technology Graz, Austria
Andrea Basso, University of Birmingham, UK, University of Bristol, UK
Gaetan Cassiers, University of Technology Graz, Austria
Ahmet Can Mert, University of Technology Graz, Austria
Sujoy Sinha Roy, University of Technology Graz, Austria

Lattice-based cryptography has laid the foundation of various modern-day cryptosystems that cater to several applications, including post-quantum cryptography. For structured lattice-based schemes, polynomial arithmetic is a fundamental part. In several instances, the performance optimizations come from implementing compact multipliers due to the small range of the secret polynomial coefficients. However, this optimization does not easily translate to side-channel protected implementations since masking requires secret polynomial coefficients to be distributed over a large range. In this work, we address this problem and propose two novel generalized techniques, one for the number theoretic transform (NTT) based and another for the non-NTT-based polynomial arithmetic. Both these proposals enable masked polynomial multiplication while utilizing and retaining the small secret property. For demonstration, we used the proposed technique and instantiated masked multipliers for schoolbook as well as NTT-based polynomial multiplication. Both of these can utilize the compact multipliers used in the unmasked implementations. The schoolbook multiplication requires an extra polynomial accumulation along with the two polynomial multiplications for a first-order protected implementation. However, this cost is nothing compared to the area saved by utilizing the existing cheap multiplication units. We also extensively test the side-channel resistance of the proposed design through TVLA to guarantee its first-order security.

Available format(s)
Public-key cryptography
Publication info
Published by the IACR in TCHES 2023
MaskingSide-Channel AttacksLattice-based CryptographyPost- Quantum Cryptography
Contact author(s)
aikata @ iaik tugraz at
andrea basso @ bristol ac uk
gaetan cassiers @ iaik tugraz at
ahmet mert @ iaik tugraz at
sujoy sinharoy @ iaik tugraz at
2023-04-12: last of 2 revisions
2023-04-10: received
See all versions
Short URL
Creative Commons Attribution


      author = {Aikata Aikata and Andrea Basso and Gaetan Cassiers and Ahmet Can Mert and Sujoy Sinha Roy},
      title = {Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2023/517},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.