Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Lattice Problems beyond Polynomial Time

Lattice Problems beyond Polynomial Time

Thumbnail Image
Download
Name

3564246.3585227.pdf

Size

5.35 MB

Format

Adobe PDF

Checksum (MD5)

5adad1253352e66576dc2fb97703619c

Download all files submitted through automated deposit
3564246.3585227.zip (5.23 MB)
Author(s)
Aggarwal, Divesh
•
Bennett, Huck
•
Brakerski, Zvika
•
Golovnev, Alexander
•
Kumar, Rajendra
•
Li, Zeyong
•
Peters, Spencer
•
Stephens-Davidowitz, Noah
•
Vaikuntanathan, Vinod
Date Issued
June 2, 2023
Publisher
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Citation
Aggarwal, Divesh, Bennett, Huck, Brakerski, Zvika, Golovnev, Alexander, Kumar, Rajendra et al. 2023. "Lattice Problems beyond Polynomial Time."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
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.
Persistent DSpace Link
https://hdl.handle.net/1721.1/151009
DOI of Published Version
https://doi.org/10.1145/3564246.3585227
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.