256 search results - page 1 / 52 » Recursive Lattice Reduction |
SCN
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
DCG
1999
13 years 4 months ago
1999
Westudycomplexhyperplanearrangementswhoseintersectionlattices,known as the Dowling lattices, are a natural generalization of the partition lattice. We give a combinatorial descript...
EUSFLAT
2007
13 years 6 months ago
2007
We describe n-generated free MV -algebras as MV-algebras having the lattice reduct which is a direct limit in the category of distributive lattices.
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...