Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,150 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Basis (linear algebra)
Cryptanalysis
Euclidean algorithm
Integer programming
Expand
Broader (2)
Computational number theory
Linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors
Sandra Roger
,
Alberto González
,
V. Almenar
,
A. Vidal
Computers & electrical engineering
2011
Corpus ID: 3657716
2010
2010
New weak RSA keys
Abderrahmane Nitaj
2010
Corpus ID: 16791916
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…
Expand
2008
2008
Adaptive lattice reduction in MIMO systems
M. Jafari
,
H. Najafi
,
M. O. Damen
International Symposium on Information Theory and…
2008
Corpus ID: 8342569
In multiple-input multiple-output (MIMO) systems, the use of lattice reduction methods, significantly improves the performance of…
Expand
2005
2005
On estimating the lattice security of NTRU
Nick Howgrave-Graham
,
J. Hoffstein
,
J. Pipher
,
William Whyte
IACR Cryptology ePrint Archive
2005
Corpus ID: 2472989
This report explicitly refutes the analysis behind a recent claim that NTRUEncrypt has a bit security of at most 74 bits. We also…
Expand
2004
2004
On the lattice basis reduction multisequence synthesis algorithm
Liping Wang
,
Yue-fei Zhu
,
D. Pei
IEEE Transactions on Information Theory
2004
Corpus ID: 5811267
A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In…
Expand
2004
2004
Nouvelles Constructions algébriques de codes spatio-temporels atteignant le compromis "Multiplexga-Diversité"
Ghaya Rekaya Ben Othman
2004
Corpus ID: 169972304
Durant ces dernieres annees, un grand interet a ete accorde aux systemes a antennes multiples a cause de leur capacite a…
Expand
2003
2003
Improved MIMO precoding for decentralized receivers resembling concepts from lattice reduction
R. Fischer
,
C. Windpassinger
GLOBECOM '03. IEEE Global Telecommunications…
2003
Corpus ID: 738817
The paper presents an improved version of precoding, i.e., nonlinear pre-equalization, for situations with one central…
Expand
1997
1997
Factoring via Strong Lattice Reduction Algorithms
Harald Ritter
,
Carsten Rössner
IACR Cryptology ePrint Archive
1997
Corpus ID: 46028404
We address to the problem to factor a large composite number by lattice reduction algorithms. Schnorr Sc93] has shown that under…
Expand
1993
1993
Generating automatically tuned bitmaps from outlines
J. Hobby
JACM
1993
Corpus ID: 14412941
Consider the problem of generating bitmaps from character shapes given as outlines. The obvious scan-conversion process does not…
Expand
1992
1992
Parallel gcd and Lattice Basis Reduction
Jean-Louis Roch
,
G. Villard
Conference on Algorithms and Hardware for…
1992
Corpus ID: 36023325
Gcd and lattice reduction are two major problems in the field of Parallel Algebraic Computations. To know if they are in NC is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE