Lattice Problems Beyond Polynomial Time

21 November 2022

Papers citing "Lattice Problems Beyond Polynomial Time"

4 / 4 papers shown

Title
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography O. Regev LRM 119 1,084 0 08 Jan 2024
Improved Hardness of BDD and SVP Under Gap-(S)ETH Huck Bennett Chris Peikert Yi Tang 29 10 0 09 Sep 2021
Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation Richard Ryan Williams LRM 36 59 0 18 Jan 2016
Classical Hardness of Learning with Errors Zvika Brakerski Adeline Langlois Chris Peikert O. Regev D. Stehlé 58 703 0 03 Jun 2013