Prof. Dino Festi (University of Padova)
This course is meant as a quick introduction to cryptography. We will describe private and public key cryptography, with some examples.
In this context, we will illustrate the role played by the so called trap-door functions, providing the two most important examples:
- factorization of integers,
- discrete log problem.
We will give basic examples of cryptosystems based on these functions:
- Diffie–Hellman key exchange,
- RSA.
We will provide some algebraic tools to build these and more advanced cryptosystems:
- tensor products, lattices,
- (supersingular) elliptic curves,
- elliptic curves isogenies.