Computing Shortest Lattice Vectors on Special Hardware
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, algorithmic number theory, communication theory, and cryptography. In 1996, Ajtai published his breakthrough idea how to create lattice-based one-way functions based on the worst-case hardness of an a...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English en |
| Published: |
2011
|
| Online Access: | https://tuprints.ulb.tu-darmstadt.de/2829/1/Dissertation-final.pdf Schneider, Michael <http://tuprints.ulb.tu-darmstadt.de/view/person/Schneider=3AMichael=3A=3A.html> (2011): Computing Shortest Lattice Vectors on Special Hardware.Darmstadt, Technische Universität, [Ph.D. Thesis] |