Fakultät für Informatik | KIT | Deutsch |  English  | Français


Melina Metzig-Lotter

Am Fasanengarten 5
Building 50.34

76131 Karlsruhe

Phone: + 49 721 608-44314
Fax: + 49 721 608-41777

Email: melina.metzig-lotter@kit.edu


The (preliminary) program is available (see program).



Applications can be sent to Melina Metzig-Lotter

A flyer with the details of the summer school is available here (english version only).


The speakers and the (preliminary) titles of their presentations are:



Willi Geiselmann,
Felix Ulmer
Introduction to finite fields and algorithms for discrete logarithms

Motivation for lattice cryptography - the LLL algorithm and the shortest vector problem


Sylvain Guilley Complementary Dual Codes for Counter-measures to Side-Channel Attacks


We recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance of such LCD codes must be as large as possible. We recall the known primary construction of such codes with cyclic codes, and investigate other constructions, with expanded Reed-Solomon codes and generalized residue codes, for which we study the idempotents. These constructions do not allow to reach all the desired parameters. We study then those secondary constructions which preserve the LCD property, and we characterize conditions under which codes obtained by direct sum, direct product, puncturing, shortening, extending codes, or obtained by the Plotkin sum, can be LCD.

Antoine Joux Technical history of discrete logarithms in small characteristic finite fields


Due to its use in cryptographic protocols such as the Diffie--Hellman key exchange, the discrete logarithm problem attracted a considerable amount of attention in the past 40 years. In this talk, we summarize the key technical ideas and their evolution for the case of discrete logarithms in small characteristic finite fields. This road leads from the original belief that this problem was hard enough for cryptographic purpose to the current state of the art where the algorithms are so efficient and practical that the problem can no longer be considered for cryptographic use.

Vadim Lyubashevsky Introduction to lattice cryptography


The Ring-LWE (Learning with Errors over Rings) problem is the central computational problem upon which practical lattice-based crypto is being built. During the course, I will introduce the problem, describe its connection to lattices, and describe the equivalence of its search and decision versions. Then we will construct several cryptographic primitives based on the presumed hardness of this problem.

Klaus-Jürgen MelullisPatenting of software-related inventions


Patenting of software-related inventions is one of the most contentious issues in the field of technical intellectual property rights. Both parties of the relevant discussion proceed on different assumptions and therefore tend to talk at cross purposes. However the actual economic motives of each opinion often remain concealed behind the respective statements. Opponents of software patents usually focus on software “as such” (i.e. pure software). On this basis it is not difficult to find arguments against its patentability. Proponents of patenting software usually refer (under the keyword of "computer-related inventions") to such facilities which typically involve the interaction between hardware and software. Given the increasing digitization of the technical world one can argue against a differentiation between solutions in which recording and analysis of data is carried out mechanically and those in which the same result is accomplished via software as an integral part within an overall apparatus. Here it seems important to return the dispute to its very foundations.

Jörn Müller-Quade Historical and political impact of Cryptography

Academic Organizers 

Willi Geiselmann (Karlsruhe Institute of Technology)

Dennis Hofheinz (Karlsruhe Institute of Technology)

Jörn Müller-Quade (Karlsruhe Institute of Technology)

Felix Ulmer (Université de Rennes 1)