1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2022★ 1 cited
Lattice Problems Beyond Polynomial Time
Divesh Aggarwal, Huck Bennett, Zvika Brakerski +6
We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-…
cs.CC2022
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!
Divesh Aggarwal, Rajendra Kumar
Recent work [BGS17,ABGS19] has shown SETH hardness of CVP in the norm for any that is not an even integer. This result was shown by giving a Karp reduction from -SA…