256 search results - page 17 / 52 » Recursive Lattice Reduction |
135
click to vote
FOCS
2004
IEEE
15 years 6 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 ...
146
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
128
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
104
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
130
click to vote
LATINCRYPT
2010
15 years 29 days ago
2010
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...