598 search results - page 9 / 120 » Predicting Lattice Reduction |
300
Voted
C3S2E
2011
ACM
14 years 7 months ago
2011
ACM
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, th...
121
Voted
ARITH
2007
IEEE
15 years 7 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
111
click to vote
MST
2007
15 years 3 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
91
Voted
ACNS
2009
Springer
15 years 10 months ago
2009
Springer
98
Voted
ANTS
2004
Springer
15 years 9 months ago
2004
Springer