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

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

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 …

Recently, the construction of cryptographic schemes based on hard lattice problems has
gained immense popularity. Apart from being quantum resistant, lattice-based cryptography …

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

Wireless sensor networks aim to collect environmental data for monitoring and decision-
making purposes, often relying on low-power sensor nodes with limited computational …

Saber is a module-lattice-based key encapsulation scheme that has been selected as a
finalist in the NIST Post-Quantum Cryptography standardization project. As Saber computes …

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

In 2016, the National Institute of Standards and Technology (NIST) announced an open
competition with the goal of finding and standardizing suitable algorithms for quantum …

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 …