Schedule and Abstracts All talks will take place at the Institute of Mathematics. = Expository Monday, August 13 9:00-9:10 Welcome words Gerhard Frey 9:10-10:40 Galois Theory: the Key to Numbers and Cyphers I Joachim von zur Gathen 11:00-12:45 Computational complexity and cryptography Lunch Break Roberto Avanzi 14:30-15:20 Arithmetic of supersingular Koblitz curves in characteristic three Joachim von zur Gathen 15:45-17:30 Computational complexity and cryptography Tuesday, August 14 Gerhard Frey 9:00-10:45 Galois Theory: the Key to Numbers and Cyphers II Jim Massey 11:00-12:45 TBA Lunch Break Lenny Taelman 14:30-15:30 Cyclotomic function fields and values of L-functions Douglas Ulmer 15:45-16:45 Arithmetic of Jacobians in Artin-Schreier extensions Marc Palm 17:00-17:30 Which factors can occur in an automorphic representations? 1 Wednesday, August 15 Jim Massey 9:00-10:45 TBA Thomas Mittelholzer 11:00-12:00 Coding techniques for data storage systems Jan Tuitman 12:10-13:00 TBA Lunch Break Alexei Panchishkin 14:30-15:30 Applications of Drinfeld modules in cryptography Matthew Papanikolas 15:45-16:45 Explicit class field theory for function fields Ralf Butenuth 17:00-18:00 Quaternionic Drinfeld modular forms and harmonic cocycles Thursday, August 16 Federico Pellarin 9:00-10:00 On the values of Goss' zeta function Alina C. Cojocaru 10:15-11:15 Frobenius distributions for generic Drinfeld modules of rank 2 Hans-Georg R¨uck 11:30-12:30 On uniformizable t-modules, an example Lunch Break Dinesh Thakur 14:30-15:30 Automata: Tools and appplications to function field arithmetic Florian Breuer 15:45-16:45 An invitation to the Andre-Oort Conjecture Douglas Ulmer 17:00-18:00 Birch and Swinnerton-Dyer conjecture 2 Friday, August 17 Yuri Zarhin 9:00-10:00 Brauer-Grothendieck groups and Brauer-Manin sets Matthew Papanikolas 10:15-11:15 Hyperderivative power sums and log-algebraicity identities Michael Spiess 11:30-12:30 p-adic L-functions via group cohomology Lunch Break C´ecileArmana 14:30-15:30 Explicit bases of modular symbols over function fields Fu-Tsun Wei 15:45-16:45 On Rankin triple product L-functions and function field analogue of Gross-Kudla formula Saturday, August 18 Dinesh Thakur 9:00-10:00 Higher multiplicities and arithmetic derivatives Florian Breuer 10:15-11:15 On Drinfeld modular polynomials Gebhard B¨ockle 11:30-12:30 Independence of `-adic Galois representations over finitely generated fields 3 Abstracts C´ecileArmana (University of M¨unster) Explicit bases of modular symbols over function fields. We will discuss Teitelbaum's theory of modular symbols over a rational function field of positive characteristic. They are an essential tool for computations of certain automorphic forms, Drinfeld modular forms and elliptic curves over such a field. As in the classical setting the space of modular symbols is described in a very combinatorial way by a finite presentation. We will explain how explicit bases may be derived for several congruences subgroups (such a statement is not known in the classical case). We will also mention applications. Roberto Avanzi (Qualcomm Research) Arithmetic of supersingular Koblitz curves in characteristic three. In this presentation we show how knowledge from algebraic geometry, algebraic number theory and \low brow" fiddling with explicit aspects of the arithmetic of curves come together to bring significant practical performance enhancements. The main topic here are digital expansions of scalars for supersingular Koblitz curves in characteristic three { curves which can be used in pairing-based cryptography. Since in pairing-based protocols besides pairing computations also scalar multiplications are required, and the performance of the latter is not negligible, improving it is clearly im- portant as well. The digital expansions are used in a kind of \double-and-add" scalar multiplication algorithm, where \doubling" is replaced by a the Frobenius endomorphism. The considered expansions of integers are therefore made not to an integral base, but to the algebraic base of τ, where τ is a zero of a polynomial τ 2 ± 3τ + 3. We consider several properties of these expansions and apply them to scalar multiplication on the aforementioned curves. For instance, we construct digit sets for these expansions as products of powers of alge- braic integers associated to certain endomorphisms of the curve. The starting point is a structure theorem for unit groups of residue classes of a quadratic order associated to the Frobenius endomorphism. The algebraic integers we choose are associated to generators of these unit groups. There are of course several choices for these generators: we chose generators associated to endomorphisms for which we could find efficient explicit formulae in a suitable coordinate system. This is a joint work with Clemens Heuberger (Klagenfurt, Austria) and Helmut Prodinger (Stellenbosch, South Africa). 4 Gebhard B¨ockle (Heidelberg University) Independence of `-adic Galois representations over finitely generated fields. Let K be a finitely generated field (over its prime field) and let X be a scheme of finite type q over K. We consider the family of `-adic cohomology groups V` = Hc (X; Q`) while ` varies over the rational primes. For each ` this yields a Galois representation of the absolute Galois group GK of K on the finite dimensional vector spaces V`. Two basic questions are: (1) What is the image of GK in Aut(V`)? (2) Are the images independent? In the simplest case, K a number field and X an elliptic curve, both questions were answered by Serre in 1971. In general Question (1) is very difficult, already in the case that X is an abelian variety over K. The talk will focus on Question (2). It was recently answered by Serre if K is a number fields and by Gajda-Petersen if K is of characteristic zero. The talk is on joint work with W. Gajda and S. Petersen, which provides the \expected" answer for K of positive characteristic. Florian Breuer (Stellenbosch University) On Drinfeld modular polynomials. We construct Drinfeld modular polynomials which relate the isomorphism invariants of rank r Drinfeld Fq[T ]-modules which are linked by an isogeny of a given type. We also prove a generalization of the Kronecker congruence relations for these poynomials. Joint work with Hans-Georg Rueck. Ralf Butenuth (Heidelberg University) Quaternionic Drinfeld modular forms and harmonic cocycles. Drinfeld modular forms for congruence subgroups of GL2(Fq[T ]) were introduced in the 1980's by Goss as an analogue for function fields of classical modular forms. By a result of Teitelbaum they are related to combinatorial objects, called harmonic cocycles, on a Bruhat- Tits tree. We study Drinfeld modular forms for inner forms on GL2 related to unit groups in maximal orders of quaternion algebras. We obtain a result analogous to Teitelbaum's and give an explicit description of the space of harmonic cocycles, which is useful for computations. Alina C. Cojocaru (University of Illinois at Chicago) Frobenius distributions for generic Drinfeld modules of rank 2. Let q be an odd prime power, A = Fq[T ], and k = Fq(T ). Let be a generic Drinfeld A-module over k, of rank 2. We provide an explicit description of the Artin symbol in the division fields of psi, and discuss applications to problems focused on the splitting of primes of A in infinite families of division fields of . This is joint work with Mihran Papikian. 5 Gerhard Frey (University of Duisburg-Essen) Galois Theory: the Key to Numbers and Cyphers. Very often Diophantine problems can be stated in an elementary way but it is notoriously hard to solve them. The most famous example for this phenomenon was Fermat's Last Theorem. The situation becomes better whenever one finds a mathematical structure behind the problem, and in many cases this structure is delivered by the action of the Galois group on geometric objects like torsion points of elliptic curves or, more generally, abelian varieties. Then the arithmetic of Galois representations plays a dominant role. A key role in this game is occupied by Jacobian varieties of modular curves. These varieties are very well understood, and connections to modular forms allow deep theoretical and practical insights. A typical and very interesting aspect is that there is an intense interplay between theoretical and algorithmic approaches. And there is an amazing and important additional bonus: Many of the used methods and obtained results can be applied to construct public key crypto systems and to discuss their security. In the lectures we shall try to explain both background and results as well as conjectures and applications of this in this exciting part of arithmetic geometry. Joachim von zur Gathen (Bonn-Aachen International Center for Information Technology) Computational complexity and cryptography. This lecture series exemplifies the influence of theoretical computer science, and of com- plexity theory in particular, on cryptography. The first example are reductions, coming from computability and the theory of P vs. NP, and now a standard tool in theoretical cryptography. The second one concerns structured models, called generic computations in cryptography. Here one does not consider a general model of computation like a Turing machine, but specialized calculations, such as arithmetic operations for arithmetic prob- lems. In such a model, the discrete logarithm problem can actually be proved to be hard. The lectures end with an idiosyncratic view on ethics in science. 6 Thomas Mittelholzer (IBM Zurich Research Laboratory) Coding Techniques for Data Storage Systems. From a coding perspective, data storage devices can be considered as a communication channel in time, where data is stored at some instance in time and read back later. In addition to the underlying channel characteristics, coding for storage needs to take ap- plication specific requirements into account, namely, very low error rates, limited delay, and limited (decoding) complexity.