Estimating Key Sizes for High Dimensional Lattice-Based Systems
From MaRDI portal
Publication:2870100
DOI10.1007/978-3-642-45239-0_17zbMath1317.94139OpenAlexW1527798905MaRDI QIDQ2870100
Joop van de Pol, Nigel 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
Related Items (6)
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 ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ 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
Uses Software
This page was built for publication: Estimating Key Sizes for High Dimensional Lattice-Based Systems
