Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
From MaRDI portal
Publication:6190160
DOI10.1007/978-3-031-38554-4_27MaRDI QIDQ6190160
No author found.
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- An LLL algorithm for module lattices
- Worst-case to average-case reductions for module lattices
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Subexponential class group and unit group computation in large degree number fields
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Short Bases of Lattices over Number Fields
- Advanced Topics in Computional Number Theory
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves
- Fully homomorphic encryption using ideal lattices
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On module unique-SVP and NTRU
- On the hardness of the NTRU problem
