92 search results - page 1 / 19 » Generating Shorter Bases for Hard Random Lattices |
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
MOC
2000
13 years 4 months ago
2000
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...