Ideal-SVP is hard for small-norm uniform prime ideals
From MaRDI portal
Publication:6587946
DOI10.1007/978-3-031-48624-1_3zbMATH Open1545.94063MaRDI QIDQ6587946
Benjamin Wesolowski, Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé
Publication date: 15 August 2024
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Relations with coding theory (11H71)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Lovász' lattice reduction and the nearest lattice point problem
- On the ideal shortest vector problem over random rational primes
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Approx-SVP in ideal lattices with pre-processing
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- On Ideal Lattices and Learning with Errors over Rings
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Class Field Theory
- Pseudorandomness of ring-LWE for any ring and modulus
- Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves
- Fully homomorphic encryption using ideal lattices
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- On module unique-SVP and NTRU
- On the hardness of the NTRU problem
Related Items (1)
This page was built for publication: Ideal-SVP is hard for small-norm uniform prime ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587946)