On module unique-SVP and NTRU
From MaRDI portal
Publication:6135456
DOI10.1007/978-3-031-22969-5_24zbMath1519.94116OpenAlexW4297266781MaRDI QIDQ6135456
Joël Felderhoff, Damien Stehlé, Alice Pellet-Mary
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_24
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Evaluation of number-theoretic constants (11Y60)
Related Items (2)
Lattice-based cryptography: a survey ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The probability that random algebraic integers are relatively \(r\)-prime
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- On the computation of the HNF of a module over the ring of integers of a number field
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Slide reduction, revisited -- filling the gaps in SVP approximation
- An LLL algorithm for module lattices
- Approx-SVP in ideal lattices with pre-processing
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- A Decade of Lattice Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- Hermite and Smith normal form algorithms over Dedekind domains
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On the hardness of the NTRU problem
This page was built for publication: On module unique-SVP and NTRU
