Seminar Advanced Topics in Crytography

Corresponding entry in Aachen Campus, Bonn Basis.

Lecture

Time & Place

Thursday, 10⁰⁰-12⁰⁰, b-it 1.25

First meeting: Thursday, 3 November 2011.

Prerequisites

Basic knowledge of cryptography and fast understanding of mathematical and computer science topics is required.

The topic is not yet determined. Previous instantiations dealt with Fuzzy Coding Theory, Zero-Knowledge, PCP, Ellitpic Curve Theory, ... In any case the topic will try to dig deeper than what you expect in a standard course or seminar.

Well, this semester we decided to focus on...

Analytical Number Theory

with a special focus on smooth numbers, Riemann's Zeta function, the Prime Number Theorem and related results

We will focus on one book and two overview papers:

Edwards (1974). Riemann's Zeta Function. ISBN 9780486417400. (Eg. Amazon.)
Granville (2008). Smooth numbers: computational number theory and beyond. PDF.
Hildebrandt & Tenenbaum (1993). Integers without large prime factors. Journal de théorie des nombres de Bordeaux 5(2), 411-484. WWW.

Further sources (eg. lecture notes by Prof. Franke) may be added as needed.

A collection of some results in this context and possible further topics is contained in: Nüsken (2011). Primeflux.

Schedule

24 November 2010, 10⁰⁰: Daniel Loebenberger, ??

Literature

Allocation

2 SWS, 4 credits.

Media Informatics, Communication Skills.
University of Bonn - Computer Science, A or A1.
University of Bonn - Mathematics.