International School on Mathematical Cryptology 2008: Mathematical Foundations of Cryptology

Faculty of Mathematics and Statistics, Universitat Politècnica de Catalunya,
Barcelona, Spain, September 22-26, 2008

Webpage: http://www-ma4.upc.edu/mak/ismc2008/

As a continuation of a series of events on Mathematical Cryptology that have taken place in the Netherlands and in Spain from 2003, the Spanish Thematic Network on Mathematics for the Information Society is organizing the 2008 International School on Mathematical Cryptology (ISMC 2008). The International School consists of four tutorials (from Monday 22 to Thursday 25), and a one-day Research Seminar on Mathematical Cryptology (on Friday 26).

Research Seminar

The Research Seminar on Mathematical Cryptology consists of two invited talks:

• Venkatesan Guruswami (Univ. of Washington): "List error-correction: New constructions and algorithms" (see abstract)
• Nigel Smart (Univ. of Bristol): "Beyond the 80 bit barrier" (see abstract)

and some shorter talks by members of the Network. We encourage PhD students to submit a short abstract (2 or 3 pages) of a cryptologic research work in progress. Please, send the abstract by e-mail to cpadro (at) ma4.upc.edu, preferably as an attached PDF file, along with your complete affiliation, before September 8, 2008. Accepted talks will be notified in September 15.

Tutorials

The tutorials are intended for PhD students (and post-docs) in mathematics and theoretical computer science. The required background knowledge is the standard undergraduate curriculum in basic algebra, number theory, probability theory and/or theoretical computer science. No prior knowledge of cryptology is required.

• "Quantum Information Theory & Crypto" (abstract), by Serge Fehr (CWI)
• "Public key encryption from a mathematical perspective" (abstract), by Dennis Hofheinz, (CWI)
• "Algebraic Function Fields and Applications in Coding Theory" (abstract), by Alp Bassa, (EPFL)
• "Combinatorial and Algebraic Aspects of Secret Sharing and Secure Multiparty Computation" (abstract), by Carles Padró, (UPC) and Ronald Cramer, (CWI & Leiden Univ.)

Each tutorial consists of 4 hours of instruction, 1 hour of problem solving and 1 hour of discussion of the solutions. Course notes detailing definitions, theorems and proofs, as well as the exercises, will be made available at the course.

Financial support

(See registration)

Organizers

Sponsors