10 search results - page 1 / 2 » The Lattice Reduction Algorithm of Gauss: An Average Case An... |
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
STOC
1989
ACM
13 years 9 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
IACR
2011
12 years 4 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...