Imperial College London > Talks@ee.imperial > COMMSP Seminar > New Trends in Lattice-based Cryptography

New Trends in Lattice-based Cryptography

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Cong Ling.

Classical public-key cryptography based on the hardness of factoring (RSA) and discrete logarithm (DSA and ECC ) can theoretically be broken by a quantum computer. But several alternatives are known. This talk will deal with what is perhaps the main alternative: lattice-based cryptography, which, in some sense, dates back to the early days of public-key cryptography, but with major improvements in the past ten years. Lattices claim several benefits: potential resistance to quantum computers, improved efficiency (for certain schemes), and special properties such as security based on worst-case assumptions (rather than average-case ssumptions) and very recently, identity-based cryptography and fully-homomorphic encryption, the latter currently attracting a lot of interest. We will survey the pros and cons of lattice-based cryptography, and highlight the differences with classical public-key cryptography.

No prior knowledge of lattices is required.

Bio: Phong Q. Nguyen was born in 1975 in Paris, France. He was a graduate student of the École normale supérieure de Lyon, 1993-1997, Passed the National Agrégation de Mathématiques, 1997, did Ph.D. at the Computer science department of the École normale supérieure, 1996-1999, and obtained Habilitation à diriger des recherches, Université Paris 7, 2007. From 2000-08, he was a CNRS researcher at the École normale supérieure. From 2008-now, he is the INRIA research director in the CRYPTO /CASCADE team.

His Current research interests include Algorithmic number theory (lattice reduction, integer factorization), Cryptanalysis, Smart card applications, and Complexity theory. He won the Best Paper Award at EUROCRYPT 2006 and the 2001 Cor Baayen Award.

Dr Nguyen is on the editorial boards of Journal of Cryptology and Journal of Mathematical Cryptology. He has extensively served on the program committees of many leading cryptoconference such as Crypto, Eurocrypt, Asiacrypt, and PKC . He is also the program chair of LLL +25 (France) to celebrate the 25th aniverary of the famous LLL algorithm and VietCrypt 2006.

This talk is part of the COMMSP Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Changes to Talks@imperial | Privacy and Publicity