The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

At IEEE Security & Privacy 2015, Bos, Costello, Naehrig, and Stebila proposed an
instantiation of Peikert's ring-learning-with-errors–based (Ring-LWE) key exchange protocol …

• Increase noise parameter for Kyber512 In the round-2 submission of Kyber, the decryption
error for Kyber512 was rather conservative, while at the same time, there were requests to …

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 …

Lattice-based cryptography offers some of the most attractive primitives believed to be
resistant to quantum computers. Following increasing interest from both companies and …

Quantum computing technologies pose a significant threat to the currently employed public-
key cryptography protocols. In this paper, we discuss the impact of the quantum threat on …

The subfield attack exploits the presence of a subfield to solve overstretched versions of the
NTRU assumption: norming the public key h down to a subfield may lead to an easier lattice …

We consider all LWE-and NTRU-based encryption, key encapsulation, and digital signature
schemes proposed for standardisation as part of the Post-Quantum Cryptography process …

There are two competing approaches to bootstrap the FHEW fully homomorphic encryption
scheme (Ducas and Micciancio, Eurocrypt 2015) and its variants: the original AP/FHEW …

We present novel variants of the dual-lattice attack against LWE in the presence of an
unusually short secret. These variants are informed by recent progress in BKW-style …