## Lattices that admit logarithmic worst-case to averagecase connection factors (2007)

### Cached

### Download Links

- [eprint.iacr.org]
- [eprint.iacr.org]
- [theory.lcs.mit.edu]
- [www.cc.gatech.edu]
- [theory.csail.mit.edu]
- [www.cc.gatech.edu]
- [eprint.iacr.org]
- [www.eecs.harvard.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In STOC |

Citations: | 19 - 9 self |

### BibTeX

@INPROCEEDINGS{Peikert07latticesthat,

author = {Chris Peikert and Alon Rosen},

title = {Lattices that admit logarithmic worst-case to averagecase connection factors},

booktitle = {In STOC},

year = {2007},

pages = {478--487}

}

### OpenURL

### Abstract

Abstract We demonstrate an average-case problem which is as hard as finding fl(n)-approximateshortest vectors in certain n-dimensional lattices in the worst case, where fl(n) = O(plog n).The previously best known factor for any class of lattices was fl(n) = ~O(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 algebraicnumber field. The worst-case assumption we rely on is that in some `p length, it is hard to findapproximate 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 andRosen (TCC 2006), and Lyubashevsky and Micciancio (ICALP 2006). For the connection factors fl(n) we achieve, the corresponding decisional promise problemson 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-studiedobjects 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 existand 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 upto O(n2/3-ffl) would yield connection factors better than the current best of ~O(n).