On the hardness of the NTRU problem
From MaRDI portal
Publication:6157484
DOI10.1007/978-3-030-92062-3_1zbMATH Open1514.94125MaRDI QIDQ6157484FDOQ6157484
Authors: Alice Pellet-Mary, Damien Stehlé 
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
- On module unique-SVP and NTRU
- Making NTRU as secure as worst-case problems over ideal lattices
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- Provably secure NTRU instances over prime cyclotomic rings
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- On ideal lattices and learning with errors over rings
- Factoring polynomials with rational coefficients
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient public key encryption based on ideal lattices (extended abstract)
- Advanced Topics in Computional Number Theory
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Making NTRU as secure as worst-case problems over ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Worst-case to average-case reductions for module lattices
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Candidate Multilinear Maps from Ideal Lattices
- A relative van Hoeij algorithm over number fields
- Topics in computational algebraic number theory
- An efficient and parallel Gaussian sampler for lattices
- On the ring-LWE and polynomial-LWE problems
- Approx-SVP in ideal lattices with pre-processing
- Large modulus ring-LWE \(\geq \) module-LWE
- A decade of lattice cryptography
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Short bases of lattices over number fields
- 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
- GGHLite: more efficient multilinear maps from ideal lattices
- Provably secure NTRUEncrypt over any cyclotomic field
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
Cited In (18)
- On module unique-SVP and NTRU
- Quantum partial search algorithm with smaller oracles for multiple target items
- Lattice-based cryptography: a survey
- Ideal-SVP is hard for small-norm uniform prime ideals
- NEV: faster and smaller NTRU encryption using vector decoding
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Entropic hardness of Module-LWE from module-NTRU
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- An algebraic algorithm for breaking NTRU with multiple keys
- NTRU in Quaternion Algebras of Bounded Discriminant
- NTWE: A Natural Combination of NTRU and LWE
- On codes and learning with errors over function fields
- Fiat-Shamir signatures based on module-NTRU
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- Improved computation of polynomial roots over number fields when using complex embeddings
- On the (M)iNTRU assumption in the integer case
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
This page was built for publication: On the hardness of the NTRU problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157484)
