The inapproximability of lattice and coding problems with preprocessing

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 44-52

  Feige, Uriel ^a   Micciancio, Daniele ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036287433     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Generating hard instances of lattice problems (extended abstract)
2. The hardness of approximate optima in lattices, codes, and systems of linear equations
3. The hardness of decoding linear codes with preprocessing
4. An improved worst-case to average-case connection for lattice problems (extended abstract)
5. Improved low-density subset sum algorithms
6. Hardness of approximating the minimum distance of a linear code
7. Some optimal inapproximability results
8. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
9. Solvability by radicals is in polynomial time
10. Factoring polynomials with rational coefficients
11. Integer programming with a fixed number of variables
12. The hardness of solving subset sum with preprocessing
13. The hardness of the closest vector problem with preprocessing
14. Improving lattice based cryptosystems using the hermite normal form
15. Improved cryptographic hash functions with worst-case/average-case connection
16. The rise and fall of knapsack cryptosystems
17. Disproof of the mertens conjecture
18. Factoring integers and computing discrete logarithms via Diophantine approximation