37 search results - page 6 / 8 » Some Sieving Algorithms for Lattice Problems |
IJACT
2008
13 years 6 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
AAECC
2005
Springer
13 years 6 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
ACL
2003
13 years 7 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
PROCEDIA
2010
13 years 4 months ago
2010
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
CIKM
1998
Springer
13 years 10 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...