New NTRU Records with Improved Lattice Bases
From MaRDI portal
Recommendations
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Quantum augmented lattice attack on NTRU with side information
- NTRU prime: reducing attack surface at low cost
- Message recovery attack on NTRU using a lattice independent from the public key
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A sieve algorithm for the shortest lattice vector problem
- Advanced lattice sieving on GPUs, with tensor cores
- BKZ 2.0: Better lattice security estimates
- Factoring polynomials with rational coefficients
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Faster exponential time algorithms for the shortest vector problem
- High-speed key encapsulation from NTRU
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice enumeration using extreme pruning
- LWE with side information: attacks and concrete security estimation
- NTRU Fatigue: How Stretched is Overstretched?
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Shortest vector from lattice sieving: a few dimensions for free
- Sieve algorithms for the shortest vector problem are practical
- Solving BDD by enumeration: an update
- The general sieve kernel and new records in lattice reduction
Cited in
(7)- Quantum augmented lattice attack on NTRU with side information
- Message recovery attack in NTRU through VFK lattices
- An efficient noncommutative NTRU from semidirect product
- Giant does not mean strong: cryptanalysis of BQTRU
- Finding dense submodules with algebraic lattice reduction
- Towards large-scale lattice attack: new lattice records by disk-based sieving
- On the practicality of quantum sieving algorithms for the shortest vector problem
This page was built for publication: New NTRU Records with Improved Lattice Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493386)
