Welcome to the resource topic for 2012/533
Title:
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
Authors: Thijs Laarhoven, Joop van de Pol, Benne de Weger
Abstract:This paper is a tutorial introduction to the present state-of-the-art in the field of security of lattice-based cryptosystems. After a short introduction to lattices, we describe the main hard problems in lattice theory that cryptosystems base their security on, and we present the main methods of attacking these hard problems, based on lattice basis reduction. We show how to find shortest vectors in lattices, which can be used to improve basis reduction algorithms. Finally we give a framework for assessing the security of cryptosystems based on these hard problems.
ePrint: https://eprint.iacr.org/2012/533
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .