Is lattice-based cryptography becoming practical?
Event details
| Date | 26.01.2010 |
| Hour | 14:00 |
| Speaker | Damien Stehlé |
| Location |
BC 2.29
|
| Category | Conferences - Seminars |
Lattice-based cryptography started in the mid 1990's, with the
pioneering works of Ajtai on the Shortest Vector Problem, and with the
novel GGH and NTRU cryptosystems. It has now become an extremely
active branch of cryptography, thanks to a unique combination of
attractive features. Lattice-based cryptographic primitives are often
simple and elegant, they are very flexible and also possibly quite
efficient. But above all, they provide unprecedented notions of
security: breaking the primitive would provide efficient algorithms
for worst-case instances of problems closely related to NP-hard
problems. A popular security feature is its apparent resistance to
quantum computers. In this talk, we will survey the computational
problems underlying lattice-based cryptography and describe a
few schemes. By considering the state-of-the-art attacks and
studying recently introduced schemes that are asymptotically very
efficient, we will attempt to assess the practicality of lattice-based
cryptography.
Practical information
- General public
- Free
Contact
- Martijn Stam