Symplectic Lattice Reduction and NTRU
From MaRDI portal
Publication:3593099
DOI10.1007/11761679_15zbMath1140.94339OpenAlexW2133629165MaRDI QIDQ3593099
Phong Q. Nguyen, Nicolas Gama, N. A. Howgrave-Graham
Publication date: 24 September 2007
Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11761679_15
Related Items (11)
Application of automorphic forms to lattice problems ⋮ Post-quantum cryptography: lattice signatures ⋮ Fifty Three Matrix Factorizations: A Systematic Approach ⋮ Improving convergence and practicality of slide-type reductions ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ How to pick a random integer matrix? (and other questions) ⋮ Predicting Lattice Reduction ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving exponential diophantine equations using lattice basis reduction algorithms
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- A note on optimal unimodular lattices
- Simultaneous reduction of a lattice basis and its reciprocal basis
- On the period matrix of a Riemann surface of large genus (with an appendix by J. H. Conway and N. J. A. Sloane)
- Modular lattices in Euclidean spaces
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Floating-Point LLL Revisited
- Advances in Cryptology - CRYPTO 2003
- Structured Factorizations in Scalar Product Spaces
This page was built for publication: Symplectic Lattice Reduction and NTRU
