FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

Complexity of Lattice Problems

Daniele Micciancio, Shafi Goldwasser
    Product form
      FORMAT: Hardback

      R 6,798.16 Price and availability exclusive to website

      YOU COULD EARN 6,798.16 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 1,133.02 per month!
      3x monthly payments of R 2,266.05 with
      4x fortnightly payments of R 1,699.54 with
      Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De­ spite their apparent simplicity, lattices hide a rich combinatorial struc­ ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap­ plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. 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. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.
      Format: CONTRIBUTORS: Daniele Micciancio, Shafi Goldwasser EAN: 9780792376880 COUNTRY: Netherlands PAGES: WEIGHT: 1130 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 2002-03-31 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Data Science / General, COMPUTERS / Information Theory, TECHNOLOGY & ENGINEERING / Electrical WIDTH: 155 cm SPINE:

      Book Themes:

      Information theory, Discrete mathematics, Electrical engineering, Algorithms and data structures, Mathematical theory of computation, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De­ spite their apparent simplicity, lattices hide a rich combinatorial struc­ ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap­ plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. 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. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.
      Format: CONTRIBUTORS: Daniele Micciancio, Shafi Goldwasser EAN: 9780792376880 COUNTRY: Netherlands PAGES: WEIGHT: 1130 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 2002-03-31 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Data Science / General, COMPUTERS / Information Theory, TECHNOLOGY & ENGINEERING / Electrical WIDTH: 155 cm SPINE:

      Book Themes:

      Information theory, Discrete mathematics, Electrical engineering, Algorithms and data structures, Mathematical theory of computation, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account