Lattice-based cryptography: a survey
From MaRDI portal
Publication:6183909
Recommendations
Cites work
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1341866 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- A sieve algorithm for the shortest lattice vector problem
- Approx-SVP in ideal lattices with pre-processing
- Attribute-based encryption for circuits
- BKZ 2.0: Better lattice security estimates
- Better key sizes (and attacks) for LWE-based encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computational aspects of lattices and their cryptographic applications
- Efficient identity-based encryption over NTRU lattices
- Efficient public key encryption based on ideal lattices (extended abstract)
- Factoring polynomials with rational coefficients
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Fully homomorphic encryption using ideal lattices
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice signatures without trapdoors
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Learning strikes again: the case of the DRS signature scheme
- Making NTRU as secure as worst-case problems over ideal lattices
- New directions in nearest neighbor searching with applications to lattice sieving
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On module unique-SVP and NTRU
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- On the hardness of the NTRU problem
- Provably secure NTRU instances over prime cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- Sieve algorithms for the shortest vector problem are practical
- The sphere packing problem in dimension 8
- Trapdoors for hard lattices and new cryptographic constructions
- Universal optimality of the \(E_8\) and Leech lattices and interpolation formulas
- WHAT IS...the Leech Lattice?
- Worst-case to average-case reductions for module lattices
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
Cited in
(6)- Expressive Cryptography: Lattice Perspectives
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
- Some Recent Progress in Lattice-Based Cryptography
- A decade of lattice cryptography
- LARA: a design concept for lattice-based encryption
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
This page was built for publication: Lattice-based cryptography: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183909)
