Polynomial multiplication algorithms such as Toom-Cook and the Number Theoretic
Transform are fundamental building blocks for lattice-based post-quantum cryptography. In …

This paper presents an improved Plantard's modular arithmetic (Plantard arithmetic) tailored
for Lattice-Based Cryptography (LBC). Based on the improved Plantard arithmetic, we …

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 …

We propose a hardware-optimized design that implements a Montgomery Elliptic-curve
point multiplication Algorithm over using Lopez-Dahab projective coordinates. Moreover, we …

OpenSSLNTRU: Faster post-quantum TLS key exchange Page 1 This paper is included in
the Proceedings of the 31st USENIX Security Symposium. August 10–12, 2022 • Boston, MA …

In this brief, we realize different architectural techniques for improving the performance of
post-quantum cryptography (PQC) algorithms when implemented as hardware accelerators …

Masking is the main countermeasure against side-channel attacks on embedded devices.
For cryptographic algorithms that combine Boolean and arithmetic masking, one must …

Abstract At Indocrypt 2021, Hermelink, Pessl, and Pöppelmann presented a fault attack
against Kyber in which a system of linear inequalities over the private key is generated and …

High-degree, low-precision polynomial arithmetic is a fundamental computational primitive
underlying structured lattice based cryptography. Its algorithmic properties and suitability for …

Resource-constrained devices such as wireless sensors and Internet of Things (IoT) devices
have become ubiquitous in our digital ecosystem. These devices generate and handle a …