NTRU Fatigue: How Stretched is Overstretched?
From MaRDI portal
Publication:6045070
DOI10.1007/978-3-030-92068-5_1zbMath1514.94079OpenAlexW4205873558MaRDI QIDQ6045070
Wessel P. J. van Woerden, Léo Ducas
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/31351
Related Items (12)
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Shorter hash-and-sign lattice-based signatures ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Fast practical lattice reduction through iterated compression ⋮ Finding short integer solutions when the modulus is small ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Compact lattice gadget and its applications to hash-and-sign signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Second order statistical behavior of LLL and BKZ
- On the success probability of solving unique SVP via BKZ
- LWE with side information: attacks and concrete security estimation
- Homomorphic encryption for finite automata
- Revisiting the expected cost of solving uSVP and applications to LWE
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- 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
- BKZ 2.0: Better Lattice Security Estimates
- Efficient Public Key Encryption Based on Ideal Lattices
- Quantum Computation and Lattice Problems
- Candidate Multilinear Maps from Ideal Lattices
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- On Ideal Lattices and Learning with Errors over Rings
- MaTRU: A New NTRU-Based Cryptosystem
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Computing Generator in Cyclotomic Integer Rings
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: NTRU Fatigue: How Stretched is Overstretched?
