The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

In this paper, we introduce Saber, a package of cryptographic primitives whose security
relies on the hardness of the Module Learning With Rounding problem (Mod-LWR). We first …

We present the first side-channel attack on a lattice-based signature scheme, using the
Flush+ Reload cache-attack. The attack is targeted at the discrete Gaussian sampler, an …

Public-key cryptography is an indispensable component used in almost all of our present-
day digital infrastructure. However, most if not all of it is predominantly built upon hardness …

Sampling integers with Gaussian distribution is a fundamental problem that arises in almost
every application of lattice cryptography, and it can be both time consuming and challenging …

Polynomial multiplication is the basic and most computationally intensive operation in ring-
learning with errors (ring-LWE) encryption and" somewhat" homomorphic encryption (SHE) …

Abstract The recent Bimodal Lattice Signature Scheme (Bliss) showed that lattice-based
constructions have evolved to practical alternatives to RSA or ECC. Besides reasonably …

Modern lattice-based public-key cryptosystems require sampling from discrete Gaussian
(normal) distributions. The paper surveys algorithms to implement such sampling efficiently …

Lattice-based cryptography is one of the most promising branches of quantum resilient
cryptography, offering versatility and efficiency. Discrete Gaussian samplers are a core …

Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based
cryptography. Several recent works have shown that the timing leakage from a non-constant …