A decade of lattice cryptography

C Peikert - Foundations and trends® in theoretical computer …, 2016 - nowpublishers.com
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 …

Post-quantum lattice-based cryptography implementations: A survey

H Nejatollahi, N Dutt, S Ray, F Regazzoni… - ACM Computing …, 2019 - dl.acm.org
The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

[PDF][PDF] Falcon: Fast-Fourier lattice-based compact signatures over NTRU

PA Fouque, J Hoffstein, P Kirchner… - Submission to the NIST's …, 2018 - di.ens.fr
This document is the supporting documentation of Falcon. It is organized as follows. Chapter
2 explains the overall design of Falcon and its rationale. Chapter 3 is a complete …

Lattice signatures and bimodal Gaussians

L Ducas, A Durmus, T Lepoint… - Annual Cryptology …, 2013 - Springer
Our main result is a construction of a lattice-based digital signature scheme that represents
an improvement, both in theory and in practice, over today's most efficient lattice schemes …

Lattice signatures without trapdoors

V Lyubashevsky - Annual International Conference on the Theory and …, 2012 - Springer
We provide an alternative method for constructing lattice-based digital signatures which
does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan …

Candidate multilinear maps from ideal lattices

S Garg, C Gentry, S Halevi - … 32nd Annual International Conference on the …, 2013 - Springer
We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …

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 …

Trapdoors for hard lattices and new cryptographic constructions

C Gentry, C Peikert, V Vaikuntanathan - Proceedings of the fortieth …, 2008 - dl.acm.org
We show how to construct a variety of" trapdoor" cryptographic tools assuming the worst-
case hardness of standard lattice problems (such as approximating the length of the shortest …

Bonsai trees, or how to delegate a lattice basis

D Cash, D Hofheinz, E Kiltz, C Peikert - Journal of cryptology, 2012 - Springer
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to
resolve some important open problems in the area. Applications of bonsai trees include an …

A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and graded encoding schemes

M Albrecht, S Bai, L Ducas - Annual International Cryptology Conference, 2016 - Springer
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 …