Lattice Reduction Algorithms: Theory and Practice
From MaRDI portal
Publication:3003370
DOI10.1007/978-3-642-20465-4_2zbMATH Open1281.94046OpenAlexW1505452726MaRDI QIDQ3003370FDOQ3003370
Authors: Phong Q. Nguyen 
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_2
Recommendations
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Towards faster polynomial-time lattice reduction
- A hierarchy of polynomial time lattice basis reduction algorithms
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Probabilistic Analyses of Lattice Reduction Algorithms
- Lattice reduction using a Euclidean algorithm
- Heuristics on lattice basis reduction in practice
- scientific article; zbMATH DE number 3972987
- scientific article; zbMATH DE number 1643920
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cited In (18)
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- Predicting Lattice Reduction
- Lattice reduction: a toolbox for the cryptoanalyst
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice attacks on NTRU and LWE: a history of refinements
- Lattice Reduction for Modular Knapsack
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Title not available (Why is that?)
- On Reduct Construction Algorithms
- Lattice-based fault attacks on signatures
- On the complexity of the BKW algorithm on LWE
- Introduction to lattice theory with computer science applications
- Title not available (Why is that?)
- Generalized approach for analysing quantum key distribution experiments
- Title not available (Why is that?)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
- Title not available (Why is that?)
Uses Software
This page was built for publication: Lattice Reduction Algorithms: Theory and Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003370)
