Generating hard instances of the short basis problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 1-9

  Ajtai, Miklós ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CRYPTOGRAPHIC PROTOCOLS; HARD INSTANCES; LATTICE PROBLEMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RANDOM CLASS; RANDOM LATTICE; SHORT VECTORS;

POLYNOMIAL APPROXIMATION;

EID: 84887467921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_1     Document Type: Conference Paper

References (7)

1. M. Ajtai, Generating Hard Instances of Lattice Problems, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, or Electronic Colloquium on Computational Complexity, 1996, http://www.eccc.uni-trier.de/eccc/ .
2. M. Ajtai and C. Dwork, A Public-Key Cryptosystem with Worst-Case/Average- Case Equivalence, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997.
3. J-Y Cai, Some Recent Progress on the Complexity of Lattice Problems, Elec- Tronic Colloquium on Computational Complexity, 1999, http://www.eccc.uni- trier.de/eccc/to appear in the Proceedings of the IEEE Conference of Compu- Tational Complexity, 1999.
4. J-Y Cai, A. Nerurkar. An Improved Worst-Case to Average-Case Connection for Lattice Problems. In Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, 468-477.
5. O. Goldreich, S. Goldwasser, S. Halevi, Collision-free hashing from lattice problems, Electronic Colloquium, on Computational Complexity, 1996, http://www.eccc.uni-trier.de/eccc/.
6. O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduc- Tion problems, In Advances in Cryptology-Crypto'97, Burton S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294:112-131, Springer-Verlag, 1997.
7. O. Goldreich, S. Goldwasser, S. Halevi, Eliminating decryption errors in the Ajtai- Dwork cryptosystem, In Advances in Cryptology-Crypto'97, Burton S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294:105-111, Springer-Verlag, 1997.