BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Is lattice-based cryptography becoming practical?
DTSTART:20100126T140000
DTSTAMP:20260407T135813Z
UID:d9f70313a59d33b896784f9871ef871c330bfb818dd22a012e8bf8d2
CATEGORIES:Conferences - Seminars
DESCRIPTION:Damien Stehlé\nLattice-based cryptography started in the mid 
 1990's\, with the\npioneering works of Ajtai on the Shortest Vector Proble
 m\, and with the\nnovel GGH and NTRU cryptosystems. It has now become an e
 xtremely\nactive branch of cryptography\, thanks to a unique combination o
 f\nattractive features. Lattice-based cryptographic primitives are often\n
 simple and elegant\, they are very flexible and also possibly quite\neffic
 ient. But above all\, they provide unprecedented notions of\nsecurity: bre
 aking the primitive would provide efficient algorithms\nfor worst-case ins
 tances of problems closely related to NP-hard\nproblems. A popular securit
 y feature is its apparent resistance to\nquantum computers. In this talk\,
  we will survey the computational\nproblems underlying lattice-based crypt
 ography and describe a\nfew schemes.  By considering the state-of-the-art 
 attacks and\nstudying recently introduced schemes that are asymptotically 
 very\nefficient\, we will attempt to assess the practicality of lattice-ba
 sed\ncryptography.
LOCATION:BC 2.29
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR