Ideal-SVP is hard for small-norm uniform prime ideals

DOI10.1007/978-3-031-48624-1_3zbMATH Open1545.94063MaRDI QIDQ6587946FDOQ6587946

Authors: Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski 

Publication date: 15 August 2024

Recommendations

• On the ideal shortest vector problem over random rational primes
• On module unique-SVP and NTRU
• Short Stickelberger class relations and application to Ideal-SVP
• On the hardness of the NTRU problem
• Random self-reducibility of ideal-SVP via Arakelov random walks

zbMATH Keywords

Gentry's reductionshortest vector problem for ideal lattices

Mathematics Subject Classification ID

Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16) Relations with coding theory (11H71)

Cites Work

• On ideal lattices and learning with errors over rings
• Fully homomorphic encryption using ideal lattices
• On lattices, learning with errors, random linear codes, and cryptography
• Efficient public key encryption based on ideal lattices (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Lovász' lattice reduction and the nearest lattice point problem
• Generalized Compact Knapsacks Are Collision Resistant
• Theory of Cryptography
• Title not available (Why is that?)
• Toward basing fully homomorphic encryption on worst-case hardness
• Class Field Theory
• Approx-SVP in ideal lattices with pre-processing
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Pseudorandomness of ring-LWE for any ring and modulus
• Recovering short generators of principal ideals in cyclotomic rings
• Short Stickelberger class relations and application to Ideal-SVP
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• On the ideal shortest vector problem over random rational primes
• Random self-reducibility of ideal-SVP via Arakelov random walks
• On the hardness of the NTRU problem
• Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
• On module unique-SVP and NTRU

Cited In (1)

• Cryptanalysis of rank-2 module-LIP in totally real number fields

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)