86 search results - page 11 / 18 » A 3-Dimensional Lattice Reduction Algorithm |
ECCC
2008
13 years 7 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
ICFCA
2004
Springer
14 years 1 months ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
CALC
2001
Springer
14 years 7 days ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
DCC
2003
IEEE
14 years 7 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...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...