Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

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 …

Lattice-based cryptographic primitives are believed to offer resilience against attacks by
quantum computers. We demonstrate the practicality of post-quantum key exchange by …

This is a textbook about quantum walks and quantum search algorithms. The readers will
take advantage of the pedagogical aspects and learn the topics faster and make less effort …

Many recent private set intersection (PSI) protocols encode input sets as polynomials. We
consider the more general notion of an oblivious key-value store (OKVS), which is a data …

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 …

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit
special structures of the rings used in those cryptosystems. The same structures are also …

We introduce models of computation that enable direct comparisons between classical and
quantum algorithms. Incorporating previous work on quantum computation and error …