We a good story
Quick delivery in the UK

Complexity of Lattice Problems

- A Cryptographic Perspective

About Complexity of Lattice Problems

The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's.

Show more
  • Language:
  • English
  • ISBN:
  • 9781461352938
  • Binding:
  • Paperback
  • Pages:
  • 220
  • Published:
  • October 29, 2012
  • Edition:
  • 12002
  • Dimensions:
  • 155x235x12 mm.
  • Weight:
  • 367 g.
Delivery: 2-4 weeks
Expected delivery: October 29, 2024

Description of Complexity of Lattice Problems

The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's.

User ratings of Complexity of Lattice Problems



Find similar books
The book Complexity of Lattice Problems can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.