59 search results - page 8 / 12 » Parallel Lattice Basis Reduction |
EUROCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
CONCURRENCY
2010
13 years 8 months ago
2010
The faster growth curves in the speed of GPUs relative to CPUs in the past decade and its rapidly gained popularity have spawned a new area of development in computational technol...
DCC
2003
IEEE
14 years 10 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
CTRSA
2011
Springer
13 years 2 months ago
2011
Springer
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
WAN
1998
Springer
14 years 3 months ago
1998
Springer
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...