Loading...
Please wait, while we are loading the content...
Similar Documents
Opleiding Informatica The closest vector problem in cyclotomic lattices
| Content Provider | Semantic Scholar |
|---|---|
| Author | Woerden, Wessel P. J. Van |
| Copyright Year | 2016 |
| Abstract | In this thesis we are interested in constructing an efficient algorithm for solving the closest vector problem (CVP) in the cyclotomic lattices and their duals. We will show that every cyclotomic lattice can be constructed by direct sums and tensor products from the lattices An (n ≥ 1). For the prime power cases this results in a linear CVP algorithm for the cyclotomic lattice and its dual. For the composite case n = p · q with p and q prime we will construct a subexponential CVP algorithm and for its dual a polynomial CVP algorithm. Both of these algorithms can efficiently be extended to the n = pkql case. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://liacs.leidenuniv.nl/assets/Bachelorscripties/Inf-studiejaar-2015-2016/WesselvanWoerden.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
