Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.

Type: Article

Publication Date: 2006-01-01

Citations: 2

Locations

  • Electronic colloquium on computational complexity - View

Similar Works

Action Title Year Authors
+ On the ideal shortest vector problem over random rational primes 2020 Yanbin Pan
Jun Xu
Nick Wadleigh
Qi Cheng
+ On the ideal shortest vector problem over random rational primes 2020 Yanbin Pan
Jun Xu
Nick Wadleigh
Qi Cheng
+ PDF Chat On Beating $2^n$ for the Closest Vector Problem 2025 Amir Abboud
Rajendra Kumar
+ PDF Chat A Local-Global Approach to Solving Ideal Lattice Problems 2014 Yuan Tian
Rongxin Sun
Xueyong Zhu
+ On the Closest Vector Problem with a Distance Guarantee 2014 Daniel Dadush
Oded Regev
Noah Stephens-Davidowitz
+ On the Closest Vector Problem with a Distance Guarantee 2014 Daniel Dadush
Oded Regev
Noah Stephens-Davidowitz
+ PDF Chat Counting lattice vectors 2007 Denis Charles
+ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings 2017 Scott C. Batson
+ On Polynomial-Factor Approximations to the Shortest Lattice Vector Length 2003 Ravi Kumar
D. Sivakumar
+ Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle 2011 Chandan K. Dubey
Thomas Holenstein
+ On polynomial approximation to the shortest lattice vector length 2001 Ravi Kumar
D. Sivakumar
+ The nearest-colattice algorithm 2020 Thomas Espitau
Paul Kirchner
+ Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle 2011 Chandan Kumar Dubey
Thomas Holenstein
+ PDF Chat Space-efficient classical and quantum algorithms for the shortest vector problem 2018 Yanlin Chen
Kai-Min Chung
Ching–Yi Lai
+ Norm Orthogonal Bases and Invariants of $p$-adic Lattices 2023 Chi Zhang
Yingpu Deng
Zhaonan Wang
+ The closest vector problem in cyclotomic lattices 2016 W. van Woerden
+ Root Repulsion and Faster Solving for Very Sparse Polynomials Over $p$-adic Fields 2021 J. Maurice Rojas
Yuyu Zhu
+ Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms 2022 Huck Bennett
Mahdi Cheraghchi
Venkatesan Guruswami
João Ribeiro
+ PDF Chat Inapproximability of Sparsest Vector in a Real Subspace 2024 Vijay Bhattiprolu
Euiwoong Lee
+ On the Lattice Distortion Problem 2016 Huck Bennett
Daniel Dadush
Noah Stephens-Davidowitz

Works That Cite This (1)

Action Title Year Authors
+ Homomorphic Encryption — Theory and Application 2013 Jaydip Sen

Works Cited by This (0)

Action Title Year Authors