77 search results - page 11 / 16 » Public-Key Cryptosystems from Lattice Reduction Problems |
FOCS
2004
IEEE
13 years 11 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 ...
IACR
2011
12 years 7 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
TWC
2008
13 years 7 months ago
2008
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Lattice Reduction (LR) aided MIMO detection has been shown to provide near-optimal hard outputs. However soft outputs are required in practical systems to fully exploit gains f...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...