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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
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
In multiple-input multiple-output (MIMO) systems, the use of lattice reduction methods, significantly improves the performance of… 
2005
2005
This report explicitly refutes the analysis behind a recent claim that NTRUEncrypt has a bit security of at most 74 bits. We also… 
2004
2004
A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In… 
2004
2004
Durant ces dernieres annees, un grand interet a ete accorde aux systemes a antennes multiples a cause de leur capacite a… 
2003
2003
The paper presents an improved version of precoding, i.e., nonlinear pre-equalization, for situations with one central… 
1997
1997
We address to the problem to factor a large composite number by lattice reduction algorithms. Schnorr Sc93] has shown that under… 
1993
1993
Consider the problem of generating bitmaps from character shapes given as outlines. The obvious scan-conversion process does not… 
1992
1992
Gcd and lattice reduction are two major problems in the field of Parallel Algebraic Computations. To know if they are in NC is…