DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Lattice reduction
Lattice reduction
Arxiv:Cs/0601091V2
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
Lattice Reduction for Modular Knapsack⋆
Lattice Reduction in Two Dimensions: Analyses Under Realistic Probabilistic Models
Algorithms for the Approximate Common Divisor Problem
A Hybrid Lattice-Reduction and Meet-In-The-Middle Attack Against NTRU
A Lattice Basis Reduction Algorithm ∗
Lattice Reduction in Two Dimensions: Analyses Under Realistic Probabilistic Models
Approximate Algorithms on Lattices with Small Determinant (Extended Abstract)
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
Progress on LLL and Lattice Reduction
Lattice Reduction: a Toolbox for the Cryptanalyst
Practical, Predictable Lattice Basis Reduction ∗
An Introduction to the Theory of Lattices and Applications to Cryptography Joseph H
A Formalization of the LLL Basis Reduction Algorithm
Extended Lattice Reduction Experiments Using the BKZ Algorithm
Techniques for Solving Shortest Vector Problem
Computing an LLL-Reduced Basis of the Orthogonal Lattice Jingwei Chen, Damien Stehlé, Gilles Villard
Top View
On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO
Tensor-Based Hardness of the Shortest Vector Problem to Within Almost Polynomial Factors
Complexity of Lattice Problems
A Lightweight Implementation of Ntruencrypt for 8-Bit AVR Microcontrollers
Choosing Ntruencrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
Predicting Lattice Reduction
Ntruencrypt and NTRUMLS
An LLL-Reduction Algorithm with Quasi-Linear Time Complexity Andrew Novocin, Damien Stehlé, Gilles Villard
On the Hardness of the Shortest Vector Problem Daniele Micciancio
Approximate Integer Common Divisors
On the KZ Reduction Jinming Wen and Xiao-Wen Chang
Recent Progress in Linear Algebra and Lattice Basis Reduction (Invited) Gilles Villard
Computing an LLL-Reduced Basis of the Orthogonal Lattice Arxiv
Algorithms for CRT-Variant of Approximate Greatest Common Divisor Problem ?
[A Survey with Applications in Wireless Communications]
Lattice Reduction by Random Sampling and Birthday Methods
Integer Programming and Algorithmic Geometry of Numbers
Algorithms for CRT-Variant of Approximate Greatest Common Divisor Problem Received Jul 15, 2019; Accepted Aug 25, 2020