Lattice Days
Event details
| Date | 17.02.2011 › 18.02.2011 |
| Location |
CM010 and MA A1 12
|
| Category | Conferences - Seminars |
THU - room CM010:
14:00 - 14:45: Machine-efficient polynomial approximants (Nicolas Brisebarre)
15:00 - 15:45: Covering cubes and closest vector (Martin Niemeier)
16:30 - 17:15: Security of NTRUEncrypt (Damien Stehle)
FRI - room MA A1 12:
9:30 - 10:15 : Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings (Daniel Dadush)
10:30 - 11:30: L1 a new quasi-linear LLL algorithm (Andrew Novocin)
13:30 - 14:15: Cutting planes for closest vector (Niemeier & Bonifas)
14:30 - 15:30: Analysis of the BKZ reduction algorithm (Xavier Pujol)
16:30 - 17:15: Security of NTRUEncrypt (Damien Stehle)
Links
Practical information
- General public
- Free