12 August 2016
The summer school gives an overview of two algorithmically difficult problem classes that are used in public-key cryptography (PKC): computing discrete logarithms and problems in (integer) lattices. Participants will thus learn new developments in an established problem in PKC (dLog-based systems) and in one of the most promising new areas (lattice-based cryptography).
For IT security the real implementation with all its side effects is one of the biggest problems. Almost all successful attacks on security systems exploit vulnerabilities in the implementation (software or hardware). An approach that uses coding theory for countermeasures to side-channel attacks covers this topic.
Antoine Joux, Vadim Lyubashevsky, Sylvain Guilley
Bachelor students (close to finishing their studies), master students, PhD students and interested researchers.
EUR 100: for Bachelor/Master students (fees include: lectures, meals and lodging)
EUR 250: PhD students (fees include: lectures, meals and lodging)