Contributions

  • Goldwasser, Shafi - Contributor

Publication

2002 - Springer US, Boston, MA, Massachusetts

Language

English

Word Count

55,000 words, Guess

Page Count

220 pages

Physical Format

Electronic resource

Identifiers

and 5 more
  • ISBN-139781461352938
  • ISBN-139781461508977
  • OCLC Control Number852791069
  • Better World Books9781461352938
  • Better World Books9781461508977

Classifications

  • DDC005.74
  • LCCQA76.9.D35
  • LCCQA76.9.D35QA75.5-76.

Description

The book presents a self-contained overview of the state of the art in the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. Specific topics covered are the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; an exposition of how cryptographic functions can be built and prove secure based on worst-case hardness assumptions about lattice problems; and a study of the limits of non-approximability of lattice problems. Some background in complexity theory, but no prior knowledge about lattices, is assumed.

Subjects

Other Editions

  • Complexity of Lattice Problems: a Cryptographic PerspectiveElectronic resourceSpringer US2002-01-01

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!