Sciweavers

256 search results - page 4 / 52
» Recursive Lattice Reduction
Sort
View
DM
1999
62views more  DM 1999»
13 years 5 months ago
Directed animals, forests and permutations
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...
AFRICACRYPT
2010
Springer
14 years 18 days ago
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
Jens Hermans, Michael Schneider 0002, Johannes Buc...
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 5 months ago
On the reduction of a random basis
For p n, let b (n) 1 , . . . , b (n) p be independent random vectors in Rn with the same distribution invariant by rotation and without mass at the origin. Almost surely these vec...
Ali Akhavi, Jean-François Marckert, Alain R...
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
13 years 12 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
TCOM
2010
112views more  TCOM 2010»
13 years 4 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang