Lattice Reduction Algorithms: Theory and Practice

DOI10.1007/978-3-642-20465-4_2MaRDI QIDQ3003370zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

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

Cited in

(18)

• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• scientific article; zbMATH DE number 4132270 (Why is no real title available?)
• On Reduct Construction Algorithms
• Lattice attacks on NTRU and LWE: a history of refinements
• Generalized approach for analysing quantum key distribution experiments
• Lattice Reduction for Modular Knapsack
• Introduction to lattice theory with computer science applications
• The geometry of provable security: some proofs of security in which lattices make a surprise appearance
• Lattice-based fault attacks on signatures
• scientific article; zbMATH DE number 1256681 (Why is no real title available?)
• Lattice reduction: a toolbox for the cryptoanalyst
• Predicting Lattice Reduction
• An efficient lattice reduction using reuse technique blockwisely on NTRU
• Lattice reductions over Euclidean rings with applications to cryptanalysis
• scientific article; zbMATH DE number 1643920 (Why is no real title available?)
• On the complexity of the BKW algorithm on LWE
• Sublinear root detection and new hardness results for sparse polynomials over finite fields
• scientific article; zbMATH DE number 1643923 (Why is no real title available?)

Describes a project that uses

Uses Software

• NTRU

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)