Udvidet returret til d. 31. januar 2025

Complexity of Lattice Problems - Daniele Micciancio - Bog

- A Cryptographic Perspective

Bag om 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9781461352938
  • Indbinding:
  • Paperback
  • Sideantal:
  • 220
  • Udgivet:
  • 29. oktober 2012
  • Udgave:
  • 12002
  • Størrelse:
  • 155x235x12 mm.
  • Vægt:
  • 367 g.
  • 8-11 hverdage.
  • 6. december 2024
På lager

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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.

Brugerbedømmelser af Complexity of Lattice Problems



Find lignende bøger
Bogen Complexity of Lattice Problems findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.