New NTRU Records with Improved Lattice Bases
From MaRDI portal
Publication:6493386
DOI10.1007/978-3-031-40003-2_7MaRDI QIDQ6493386
Julian Nowakowski, Elena Kirshanova, Alexander May
Publication date: 26 April 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Shortest vector from lattice sieving: a few dimensions for free
- Advanced lattice sieving on GPUs, with tensor cores
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- LWE with side information: attacks and concrete security estimation
- The general sieve kernel and new records in lattice reduction
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- BKZ 2.0: Better Lattice Security Estimates
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Solving BDD by Enumeration: An Update
- Lattice Attacks on NTRU and LWE: A History of Refinements
- High-Speed Key Encapsulation from NTRU
- A sieve algorithm for the shortest lattice vector problem
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- NTRU Fatigue: How Stretched is Overstretched?
This page was built for publication: New NTRU Records with Improved Lattice Bases
