NTWE: A Natural Combination of NTRU and LWE
From MaRDI portal
Publication:6493391
Recommendations
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- A decade of lattice cryptography
- A hierarchy of polynomial time lattice basis reduction algorithms
- Another look at tightness. II: Practical issues in cryptography
- Better key sizes (and attacks) for LWE-based encryption
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Making NTRU as secure as worst-case problems over ideal lattices
- NTRU Fatigue: How Stretched is Overstretched?
- New directions in nearest neighbor searching with applications to lattice sieving
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of the NTRU problem
- Provably secure NTRUEncrypt over any cyclotomic field
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Secure integration of asymmetric and symmetric encryption schemes
This page was built for publication: NTWE: A Natural Combination of NTRU and LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493391)