Post-quantum lattice-based cryptography implementations: A survey
The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …
schemes, leading to innovations in public key cryptography that focus on post-quantum …
Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
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 …
relies on the hardness of the Module Learning With Rounding problem (Mod-LWR). We first …
Flush, gauss, and reload–a cache attack on the bliss lattice-based signature scheme
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 …
Flush+ Reload cache-attack. The attack is targeted at the discrete Gaussian sampler, an …
Lattice-based key-sharing schemes: A survey
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 …
day digital infrastructure. However, most if not all of it is predominantly built upon hardness …
Gaussian sampling over the integers: Efficient, generic, constant-time
D Micciancio, M Walter - Advances in Cryptology–CRYPTO 2017: 37th …, 2017 - Springer
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 …
every application of lattice cryptography, and it can be both time consuming and challenging …
High-speed polynomial multiplication architecture for ring-LWE and SHE cryptosystems
Polynomial multiplication is the basic and most computationally intensive operation in ring-
learning with errors (ring-LWE) encryption and" somewhat" homomorphic encryption (SHE) …
learning with errors (ring-LWE) encryption and" somewhat" homomorphic encryption (SHE) …
Enhanced lattice-based signatures on reconfigurable hardware
Abstract The recent Bimodal Lattice Signature Scheme (Bliss) showed that lattice-based
constructions have evolved to practical alternatives to RSA or ECC. Besides reasonably …
constructions have evolved to practical alternatives to RSA or ECC. Besides reasonably …
Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
NC Dwarakanath, SD Galbraith - Applicable Algebra in Engineering …, 2014 - Springer
Modern lattice-based public-key cryptosystems require sampling from discrete Gaussian
(normal) distributions. The paper surveys algorithms to implement such sampling efficiently …
(normal) distributions. The paper surveys algorithms to implement such sampling efficiently …
On practical discrete Gaussian samplers for lattice-based cryptography
Lattice-based cryptography is one of the most promising branches of quantum resilient
cryptography, offering versatility and efficiency. Discrete Gaussian samplers are a core …
cryptography, offering versatility and efficiency. Discrete Gaussian samplers are a core …
Constant-time discrete gaussian sampling
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 …
cryptography. Several recent works have shown that the timing leakage from a non-constant …