crypt@b-it 2008

Igor Shparlinski

Cryptography: Numbers at work and play

Abstract

Anatomy of integers and cryptography: I will talk about smooth numbers and generally about the distribution of divisors of integers, and then about their not-so-well-known applications in cryptography. I will briefly explain discrete log. / factorisation applications but will concentrate on other things. Playing Hide-and-Seek in finite fields: I will talk about the Hidden Number Problem and its generalisations. I will give, explain and analyse some algorithms and show some background on lattices, and although I won't talk about exponential sums I will try to explain why we need them for.

Slides and lecture notes

You can download the lecture notes here: pdf.

And here are the slides for the course pdf.

Tutorial

Try the MuPAD notebook for the Monday tutorial.