On the hardness of the NTRU problem
From MaRDI portal
Publication:6157484
DOI10.1007/978-3-030-92062-3_1zbMath1514.94125MaRDI QIDQ6157484
Alice Pellet-Mary, Damien Stehlé
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
Related Items (9)
On codes and learning with errors over function fields ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ On module unique-SVP and NTRU ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ Lattice-based cryptography: a survey ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ Quantum partial search algorithm with smaller oracles for multiple target items
Cites Work
- Unnamed Item
- Unnamed Item
- Topics in computational algebraic number theory
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- On the ring-LWE and polynomial-LWE problems
- Provably secure NTRUEncrypt over any cyclotomic field
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Approx-SVP in ideal lattices with pre-processing
- Worst-case to average-case reductions for module lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- A relative van Hoeij algorithm over number fields
- A Decade of Lattice Cryptography
- 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
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Efficient Public Key Encryption Based on Ideal Lattices
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Candidate Multilinear Maps from Ideal Lattices
- Short Bases of Lattices over Number Fields
- Advanced Topics in Computional Number Theory
- Pseudorandomness of ring-LWE for any ring and modulus
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On the hardness of the NTRU problem
