On the concrete hardness of learning with errors

MR Albrecht, R Player, S Scott - Journal of Mathematical Cryptology, 2015 - degruyter.com
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 …

Post-quantum cryptography

DJ Bernstein, T Lange - Nature, 2017 - nature.com
Cryptography is essential for the security of online communication, cars and implanted
medical devices. However, many commonly used cryptosystems will be completely broken …

[PDF][PDF] Status report on the third round of the NIST post-quantum cryptography standardization process

G Alagic, G Alagic, D Apon, D Cooper, Q Dang, T Dang… - 2022 - tsapps.nist.gov
Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

[PDF][PDF] CRYSTALS-Kyber algorithm specifications and supporting documentation

R Avanzi, J Bos, L Ducas, E Kiltz, T Lepoint… - NIST PQC …, 2019 - pq-crystals.org
• 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 …

Post-quantum key {Exchange—A} new hope

E Alkim, L Ducas, T Pöppelmann… - 25th USENIX Security …, 2016 - usenix.org
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 …

Oblivious key-value stores and amplification for private set intersection

G Garimella, B Pinkas, M Rosulek, N Trieu… - Advances in Cryptology …, 2021 - Springer
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 …

Frodo: Take off the ring! practical, quantum-secure key exchange from LWE

J Bos, C Costello, L Ducas, I Mironov… - Proceedings of the …, 2016 - dl.acm.org
Lattice-based cryptography offers some of the most attractive primitives believed to be
resistant to quantum computers. Following increasing interest from both companies and …

New directions in nearest neighbor searching with applications to lattice sieving

A Becker, L Ducas, N Gama, T Laarhoven - … of the twenty-seventh annual ACM …, 2016 - SIAM
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we
propose a method using locality-sensitive filters (LSF), with the property that nearby vectors …

Estimate all the {LWE, NTRU} schemes!

MR Albrecht, BR Curtis, A Deo, A Davidson… - … and Cryptography for …, 2018 - Springer
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 …

State-of-the-art survey of quantum cryptography

A Kumar, S Garhwal - Archives of Computational Methods in Engineering, 2021 - Springer
In today Internet era, confidential information transmitted over an insecure channel. With the
significant development in the area of quantum computing, there is a need for unconditional …