Estimating key sizes for high dimensional lattice-based systems

DOI10.1007/978-3-642-45239-0_17MaRDI QIDQ2870100zbMATH OpenOpenAlexFDO

Authors Joop van de Pol, N. P. Smart

Publication date 17 January 2014

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45239-0_17

Mathematics Subject Classification ID

Cryptography (94A60)

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
• scientific article; zbMATH DE number 1852141

Cited in

(7)

• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Cryptanalysis of the co-ACD assumption
• Homomorphic AES evaluation using the modified LTV scheme
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
• Flattening NTRU for evaluation key free homomorphic encryption
• Simultaneous approximation problems of \(p\)-adic numbers and \(p\)-adic knapsack cryptosystems -- Alice in \(p\)-adic numberland

Describes a project that uses

Uses Software

• BKZ

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)