Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 20, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Chandan Dubey
A Lattice is a discrete subgroup of R^n. Given a list of linearly independent vectors b_1, ..., b_n called the basis -- the lattice spanned by these vectors is the set of all integer linear combinations. After the worst case to average case reduction of the shortest vector problem given by Ajtai, Lattices have seen increasing applications in cryptographic constructions. One important problem in this area is the unique shortest vector problem. In this talk, I aim to show the search to decision reduction of approximate unique shortest vector problem. On the way, we will see a simple proof of Minkowski’s convex body theorem. Joint work with Divesh Aggarwal.
Automatic MiSe System Software Version 1.4803M | admin login