NTWE: A Natural Combination of NTRU and LWE

DOI10.1007/978-3-031-40003-2_12MaRDI QIDQ6493391

Joel Gärtner

Publication date: 26 April 2024

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Provably secure NTRUEncrypt over any cyclotomic field
• Another look at tightness. II: Practical issues in cryptography
• A Decade of Lattice Cryptography
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• On Ideal Lattices and Learning with Errors over Rings
• New directions in nearest neighbor searching with applications to lattice sieving
• Secure integration of asymmetric and symmetric encryption schemes
• Lattice Attacks on NTRU and LWE: A History of Refinements
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• On lattices, learning with errors, random linear codes, and cryptography
• NTRU Fatigue: How Stretched is Overstretched?
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
• On the hardness of the NTRU problem

This page was built for publication: NTWE: A Natural Combination of NTRU and LWE