Introduction to lattices and their applications in Computer Science/Cryptography – Seminar

Activity

Course offer in the Doctoral Programme in Computer Science & Computer Engineering (DP- CSCE), in the frame of SP2 DTU

Organization

Jim BARTHEL
(jim.barthel@uni.lu)
Rajeev Anand SAHU
(rajeev.sahu@uni.lu)

Description

From May 24 to June 14 in 2019 the SP2 DTU organizes a short intense seminar about lattices and their applications in computer science and cryptography. The seminar started as a PhD initiative and has been assisted by the SP2 DTU and the Doctoral School in Science and Engineering throughout its organization process.

The seminar targets PhD candidates and (young) researchers who wish to learn about lattices and their applications. The seminar will outline the basic theory of lattices, which include but are not restricted to the mathematical foundations of lattice theory as well as computational problems involving lattices and lattice reduction.

The seminar is organized such that after an introduction session, each participant prepares a 60-90 minutes talk about a topic of his/her choice involving lattices. After each talk, there is a question and comment session. Due to this special course outline, the number of participants is limited.

The talks of the seminar are open for anyone and their presence is greatly appreciated.

Schedule

The seminar takes place at the University of Luxembourg (uni.lu) Campus Belval in the Maison du Nombre (MNO) in room MNO 1.050.
24.05.2019
  • 10:00 – 12:00 – Introduction to lattices Slides
    Barthel Jim
  • 12:00 – 13:00 – Topics related to lattices Slides
    Barthel Jim
03.06.2019
  • 09:00 – 11:00 – LLL algorithm Slides
    Sala Petra
05.06.2019
  • 09:00 – 11:00 – Babai’s nearest plane algorithm Slides
    Shaft Brian
  • 11:00 – 13:00 – Dual Lattices and Banaszczyk’s transference theorems Slides
    Notarnicola Luca
07.06.2019
  • 09:00 – 11:00 Attack the Merkle-Hellman knapsack cryptosystem using LLL
    Vitto Giuseppe
  • 11:00 – 13:00 Finding small solutions to low degree polynomials and an attack on RSA Slides
    Udovenko Aleksei
12.06.2019
  • 09:00 – 11:00 – AKS algorithm Slides
    Lima Pereira, Hilder Vítor
  • 11:00 – 13:00 – The shortest vector problem is NP- hard to approximate to within some constant Slides
    Van Wier Jeroen
14.06.2019
  • 09:00 – 11:00 Learning with errors Slides
    Soroush Najmeh
  • 11:00 – 13:00 Short integer solutions Slides
    Gini Agnese
Post-seminar
  • Complexity of LLL Slides
    El Orche Fatima Ezzahara

Documents published by the Doctoral School in Science and Engineering:

 

 

Test

Test footer

Test

Test footer

Test

Test footer

Test

Test footer