Approx-SVP in Ideal Lattices with Pre-processing
- 24 April 2019
- book chapter
- Published by Springer Nature
- p. 685-716
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Approximate Short Vectors in Ideal Lattices of $\mathbb {Q}(\zeta _{p^e})$ with Precomputation of ${\text {Cl}}(\mathcal {O}_K)$2017
- Large Modulus Ring-LWE $\ge $ Module-LWE2017
- Computing Generator in Cyclotomic Integer Rings2017
- Short Generators Without Quantum Computers: The Case of Multiquadratics2017
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields2015
- Subexponential class group and unit group computation in large degree number fieldsLMS Journal of Computation and Mathematics, 2014
- Subexponential time relations in the class group of large degree number fieldsAdvances in Mathematics of Communications, 2014
- Efficient Fully Homomorphic Encryption from (Standard) LWE2011
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages2011
- Explicit bounds for primality testing and related problemsMathematics of Computation, 1990