463 search results - page 22 / 93 » The lattice dimension of a graph |
APVIS
2007
14 years 11 months ago
2007
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ORDER
2006
14 years 9 months ago
2006
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
LATINCRYPT
2010
14 years 8 months ago
2010
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...