Lattice Problems beyond Polynomial Time
Main Authors: | , , , , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
2023
|
Online Access: | https://hdl.handle.net/1721.1/151009 |
_version_ | 1826190182244679680 |
---|---|
author | Aggarwal, Divesh Bennett, Huck Brakerski, Zvika Golovnev, Alexander Kumar, Rajendra Li, Zeyong Peters, Spencer Stephens-Davidowitz, Noah Vaikuntanathan, Vinod |
author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Aggarwal, Divesh Bennett, Huck Brakerski, Zvika Golovnev, Alexander Kumar, Rajendra Li, Zeyong Peters, Spencer Stephens-Davidowitz, Noah Vaikuntanathan, Vinod |
author_sort | Aggarwal, Divesh |
collection | MIT |
first_indexed | 2024-09-23T08:36:20Z |
format | Article |
id | mit-1721.1/151009 |
institution | Massachusetts Institute of Technology |
language | English |
last_indexed | 2024-09-23T08:36:20Z |
publishDate | 2023 |
publisher | ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing |
record_format | dspace |
spelling | mit-1721.1/1510092024-01-12T19:46:03Z Lattice Problems beyond Polynomial Time Aggarwal, Divesh Bennett, Huck Brakerski, Zvika Golovnev, Alexander Kumar, Rajendra Li, Zeyong Peters, Spencer Stephens-Davidowitz, Noah Vaikuntanathan, Vinod Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2023-07-06T20:29:40Z 2023-07-06T20:29:40Z 2023-06-02 2023-07-01T07:51:30Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-9913-5 https://hdl.handle.net/1721.1/151009 Aggarwal, Divesh, Bennett, Huck, Brakerski, Zvika, Golovnev, Alexander, Kumar, Rajendra et al. 2023. "Lattice Problems beyond Polynomial Time." PUBLISHER_POLICY en https://doi.org/10.1145/3564246.3585227 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The author(s) application/pdf ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing Association for Computing Machinery |
spellingShingle | Aggarwal, Divesh Bennett, Huck Brakerski, Zvika Golovnev, Alexander Kumar, Rajendra Li, Zeyong Peters, Spencer Stephens-Davidowitz, Noah Vaikuntanathan, Vinod Lattice Problems beyond Polynomial Time |
title | Lattice Problems beyond Polynomial Time |
title_full | Lattice Problems beyond Polynomial Time |
title_fullStr | Lattice Problems beyond Polynomial Time |
title_full_unstemmed | Lattice Problems beyond Polynomial Time |
title_short | Lattice Problems beyond Polynomial Time |
title_sort | lattice problems beyond polynomial time |
url | https://hdl.handle.net/1721.1/151009 |
work_keys_str_mv | AT aggarwaldivesh latticeproblemsbeyondpolynomialtime AT bennetthuck latticeproblemsbeyondpolynomialtime AT brakerskizvika latticeproblemsbeyondpolynomialtime AT golovnevalexander latticeproblemsbeyondpolynomialtime AT kumarrajendra latticeproblemsbeyondpolynomialtime AT lizeyong latticeproblemsbeyondpolynomialtime AT petersspencer latticeproblemsbeyondpolynomialtime AT stephensdavidowitznoah latticeproblemsbeyondpolynomialtime AT vaikuntanathanvinod latticeproblemsbeyondpolynomialtime |