Limits on the Hardness of Lattice Problems in \ell _p Norms

Authors:
Chris Peikert
Affiliations:
SRI International, MIT, USA
Venue:
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Year:
2007

Citing 0
Cited 6

Lattices that admit logarithmic worst-case to average-case connection factors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient lattice-based signature scheme

International Journal of Applied Cryptography
Explicit Hard Instances of the Shortest Vector Problem

PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
A digital signature scheme based on CV P∞

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...