Presents an overview of the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. This book covers the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; and more.
Loading similar products...
Stay informed about the best deals and price drops. Choose which notifications you'd like to receive from PriceCheck.