Estimating key sizes for high dimensional lattice-based systems
From MaRDI portal
Recommendations
- BKZ 2.0: Better lattice security estimates
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Better key sizes (and attacks) for LWE-based encryption
- Practical FHE parameters against lattice attacks
- Improving lattice based cryptosystems using the Hermite normal form
Cited in
(8)- Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems -- Alice in p-adic numberland
- Flattening NTRU for evaluation key free homomorphic encryption
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Homomorphic AES evaluation using the modified LTV scheme
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Cryptanalysis of the co-ACD assumption
- Leveled homomorphic encryption schemes for homomorphic encryption standard
This page was built for publication: Estimating key sizes for high dimensional lattice-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870100)