Complexity of Lattice Problems: A Cryptographic Perspective (Paperback)

Daniele Micciancio, Shafi Goldwasser

  • 出版商: Springer
  • 出版日期: 2012-10-29
  • 售價: $9,020
  • 貴賓價: 9.5$8,569
  • 語言: 英文
  • 頁數: 220
  • 裝訂: Paperback
  • ISBN: 1461352932
  • ISBN-13: 9781461352938
  • 下單後立即進貨 (約1週~2週)



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.