Skip to search formSkip to main contentSkip to account menu

Lattice reduction

Known as: Lattice basis reduction, Reduction 
In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Basis (linear algebra)CryptanalysisEuclidean algorithmInteger programming

Broader (2)

Computational number theoryLinear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Efficient Greedy LLL Algorithms for Lattice Decoding
The Lenstra-Lenstra-Lovász (LLL) algorithm has been adopted as a lattice reduction (LR) technique for multiple-input multiple… 
2012
2012
On the Hardness of Subset Sum Problem from Different Intervals
SUMMARY The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are… 
2010
2010
A Lattice Basis Reduction Algorithm ∗
In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a… 
2010
2010
New weak RSA keys
Let N = pq be an RSA modulus with q < p < 2 q . In this paper, we analyze the security of RSA with the class of the exponents e… 
2008
2008
A Lattice Attack on the McEliece Public Key Cryptosystem: Lattice Basis Reduction Algorithms in Cryptography
The McEliece cryptosystem was proposed by R.McEliecein 1978. In its original version it is based on Goppacodes. Given a public… 
2006
2006
Floating-Point L 2 -Approximations
: Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those… 
2004
2004
On the lattice basis reduction multisequence synthesis algorithm
A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In… 
2001
2001
F[x] -lattice basis reduction algorithm and multisequence synthesis
By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback… 
1997
1997
Factoring via Strong Lattice Reduction Algorithms
We address to the problem to factor a large composite number by lattice reduction algorithms. Schnorr Sc93] has shown that under… 
1992
1992
Parallel gcd and Lattice Basis Reduction
Gcd and lattice reduction are two major problems in the field of Parallel Algebraic Computations. To know if they are in NC is…