Utvidet returrett til 31. januar 2024

Complexity of Lattice Problems

- A Cryptographic Perspective

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 mer
  • Språk:
  • Engelsk
  • ISBN:
  • 9781461352938
  • Bindende:
  • Paperback
  • Sider:
  • 220
  • Utgitt:
  • 29. oktober 2012
  • Utgave:
  • 12002
  • Dimensjoner:
  • 155x235x12 mm.
  • Vekt:
  • 367 g.
  • BLACK NOVEMBER
  Gratis frakt
Leveringstid: 2-4 uker
Forventet levering: 30. november 2024

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

Brukervurderinger av Complexity of Lattice Problems



Finn lignende bøker
Boken Complexity of Lattice Problems finnes i følgende kategorier:

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.