77 search results - page 12 / 16 » Public-Key Cryptosystems from Lattice Reduction Problems |
CPM
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
TOC
2008
13 years 7 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
KES
2005
Springer
14 years 29 days ago
2005
Springer
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
CALC
2001
Springer
13 years 12 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...