%0 Conference Paper %1 Ajtai:1998:SVP:276698.276705 %A Ajtai, Miklós %B Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing %C New York, NY, USA %D 1998 %I ACM %K cryptography lattices %P 10--19 %R 10.1145/276698.276705 %T The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract) %U http://doi.acm.org/10.1145/276698.276705 %@ 0-89791-962-9

@inproceedings{Ajtai:1998:SVP:276698.276705, acmid = {276705}, added-at = {2019-08-27T01:42:14.000+0200}, address = {New York, NY, USA}, author = {Ajtai, Mikl\'{o}s}, biburl = {https://www.bibsonomy.org/bibtex/2fbfda058c60b75151babfe828b7d24d1/ndbunner}, booktitle = {Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing}, description = {The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)}, doi = {10.1145/276698.276705}, interhash = {09e5be2a07f225b24a0c66a0ae65fe35}, intrahash = {fbfda058c60b75151babfe828b7d24d1}, isbn = {0-89791-962-9}, keywords = {cryptography lattices}, location = {Dallas, Texas, USA}, numpages = {10}, pages = {10--19}, publisher = {ACM}, series = {STOC '98}, timestamp = {2019-08-27T01:42:14.000+0200}, title = {The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract)}, url = {http://doi.acm.org/10.1145/276698.276705}, year = 1998 }