13 search results - page 1 / 3 » Parallel Lattice Basis Reduction Using a Multi-threaded Schn... |
EUROPAR
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. In this paper, we introduce a new parallel variant of the LLL lattice basis reduction algorithm. Our new, multi-threaded algorithm is the first to provide an efficient,...
WAE
2000
14 years 6 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
C3S2E
2011
ACM
13 years 8 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...
ISSAC
1992
Springer
14 years 9 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
CRYPTO
2011
Springer
13 years 4 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...