Publication: Considerations on computational lattice problems
Considerations on computational lattice problems
Date
Date
Date
Citations
Wagner, U. (2013). Considerations on computational lattice problems. (Dissertation, University of Zurich) https://doi.org/10.5167/uzh-94030
Abstract
Abstract
Abstract
Lattices are discrete subgroups of the Euclidean space. While they are highly structured objects and their elements can easily be described by means of integer linear combinations of their basis vectors, it is possible to define NP-hard problems on them. Due to the existence of a class of lattices with favorable worst-case to average-case connection, these problems are well suited as basis for provable secure cryptosystems. The problems appearing in this thesis are the shortest vector problem (SVP), the closest vector problem (CVP) an
Metrics
Downloads
Views
Citations
Additional indexing
Creators (Authors)
Faculty
Faculty
Faculty
Item Type
Item Type
Item Type
Referees
Language
Language
Language
Place of Publication
Place of Publication
Place of Publication
Publication date
Publication date
Publication date
Date available
Date available
Date available
Number of pages
Number of pages
Number of pages
OA Status
OA Status
OA Status
Metrics
Downloads
Views
Citations
Citations
Wagner, U. (2013). Considerations on computational lattice problems. (Dissertation, University of Zurich) https://doi.org/10.5167/uzh-94030
