Lattice-based cryptography: a survey

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Factoring polynomials with rational coefficients
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Universal optimality of the \(E_8\) and Leech lattices and interpolation formulas
\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
Approx-SVP in ideal lattices with pre-processing
Worst-case to average-case reductions for module lattices
The sphere packing problem in dimension 8
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
Lattice Signatures without Trapdoors
Efficient Identity-Based Encryption over NTRU Lattices
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Better Key Sizes (and Attacks) for LWE-Based Encryption
BKZ 2.0: Better Lattice Security Estimates
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
WHAT IS...the Leech Lattice?
Sieve algorithms for the shortest vector problem are practical
Trapdoors for hard lattices and new cryptographic constructions
On Ideal Lattices and Learning with Errors over Rings
Lattice Enumeration Using Extreme Pruning
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Efficient Public Key Encryption Based on Ideal Lattices
On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
New directions in nearest neighbor searching with applications to lattice sieving
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
Computational aspects of lattices and their cryptographic applications
Fully homomorphic encryption using ideal lattices
A sieve algorithm for the shortest lattice vector problem
Attribute-based encryption for circuits
Provably Secure NTRU Instances over Prime Cyclotomic Rings
Short Stickelberger Class Relations and Application to Ideal-SVP
On lattices, learning with errors, random linear codes, and cryptography
Learning strikes again: the case of the DRS signature scheme
On module unique-SVP and NTRU
On the hardness of the NTRU problem

This page was built for publication: Lattice-based cryptography: a survey