Loading...
Please wait, while we are loading the content...
Similar Documents
Lattices that admit logarithmic worst-case to averagecase connection factors (2007)
| Content Provider | CiteSeerX |
|---|---|
| Author | Peikert, Chris Rosen, Alon |
| Abstract | We demonstrate an average-case problem which is as hard as finding γ(n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where γ(n) = O ( √ log n). The previously best known factor for any class of lattices was γ(n) = Õ(n). To obtain our results, we focus on families of lattices having special algebraic structure. Specifically, we consider lattices that correspond to ideals in the ring of integers of an algebraic number field. The worst-case assumption we rely on is that in some ℓp length, it is hard to find approximate shortest vectors in these lattices, under an appropriate form of preprocessing of the number field. Our results build upon prior works by Micciancio (FOCS 2002), Peikert and Rosen (TCC 2006), and Lyubashevsky and Micciancio (ICALP 2006). For the connection factors γ(n) we achieve, the corresponding decisional promise problems on ideal lattices are not known to be NP-hard; in fact, they are in P. However, the search approximation problems still appear to be very hard. Indeed, ideal lattices are well-studied objects in computational number theory, and the best known algorithms for them seem to perform no better than the best known algorithms for general lattices. To obtain the best possible connection factor, we instantiate our constructions with infinite families of number fields having constant root discriminant. Such families are known to exist and are computable, though no efficient construction is yet known. Our work motivates the search for such constructions. Even constructions of number fields having root discriminant up to O(n 2/3−ɛ) would yield connection factors better than the current best of Õ(n). |
| File Format | |
| Publisher Date | 2007-01-01 |
| Access Restriction | Open |
| Subject Keyword | Current Best Infinite Family Even Construction Number Field Well-studied Object Corresponding Decisional Promise Problem Ideal Lattice Efficient Construction Connection Factor Certain N-dimensional Lattice Average-case Problem Search Approximation Problem Worst-case Assumption Known Factor Possible Connection Factor Logarithmic Worst-case Prior Work General Lattice Computational Number Theory Constant Root Discriminant Algebraic Number Field Known Algorithm Appropriate Form Special Algebraic Structure |
| Content Type | Text |
