- Unit Coordinator: Roberto Civino
- ECTS Credits: 6
- Semester: 2
- Year: 1
- Campus: University of L'Aquila
- Language: English
- Aims:
Learning Objectives.
The aim of the course is to provide an introduction to modern public and private key cryptography, with particular attention to:
- algebraic computational problems on which cryptosystems are based,
- modeling and analysis of possible attack scenarios,
- security definitions from the context of provable security,in order to provide an insight into the key ingredients of a complex cryptographic protocol.
These objectives are part of the educational aims of the course of study, as the internal coherence of the master's degree course in Mathematical Engineering was verified at the time of the planning of the program.
Learning Outcomes.
Upon successful completion of the course, the candidate
- masters the basic concepts of arithmetic and theory of groups and rings necessary for cryptographic applications;
- knows the different definitions of security and the relationships between them;
- can describe encryption algorithms and can prove their correctness;
- is able to discuss the security of a cipher and the corresponding cryptanalysis methodologies;
- is able to discuss the computational complexity of cryptanalysis techniques;
- knows how to implement the studied algorithms;
- is able to design computer-aided cryptanalysis techniques against test ciphers. - Content:
MODULAR ARITHMETIC
Division with remainder. Greatest common divisor: algorithms and complexity. Prime numbers. Congruences. Integers modulo n. Modular multiplicative inverse. Phi of Euler.FINITE GROUPS
Group notion and examples. Subgroups. Order of a group and of an element. Lagrange's Theorem. Fermat's little Theorem. Euler's Theorem. Cyclic groups. Primitive elements. Isomorphism between groups. Chinese remainder theorem. Discrete logarithm and isomorphism with Zn.PUBLIC-KEY CRYPTOGRAPHY
Diffie-Hellman key exchange. Computational and decisional Diffie-Hellman problems. Relationship with the discrete logarithm problem. Pohlig-Hellman reduction. Collision methods: Pollard's Rho and baby-step/giant-step. Birthday paradox. Pohlig-Hellman exponentiation cipher. Definition of public-key cryptosystem. Chosen-plaintext attacks and indistinguishability. RSA - textbook version. The integer factorization problem. RSA textbook security and vulnerabilities. Security against chosen-ciphertext attacks. RSA with padding. ElGamal cryptosystem. Relationship with the Diffie-Hellman problem. Digital signature. RSA-FDH and DSA.PRIVATE-KEY CRYPTOGRAPHY
Definition of private-key cryptosystem. One-time-pad. Cryptanalysis of a substitution cipher. SPN and Feistel networks. Elementary notions of finite fields. Elementary notions of differential cryptanalysis. PRESENT. AES. GOST. Hash functions. Collision resistance. Merkle-Damgård construction. Attack scenarios: Security against CPA, CCA, and indistinguishability. Standard modes of operation of a block cipher. Authenticated encryption: Galois counter mode - Pre-requisites:
The course is presented in a self-contained manner and provides, in the initial stages, a review of the elementary notions of algebra on which the entire course system is structured. These contents are essential prerequisites for passing the course. The course will also cover programming topics using the languaga Magma, focused on the implementation of cryptographic schemes and their attacks. It will be assumed that students who enroll in this course have basic programming skills, as instruction on how to code will not be provided.
- Reading list:
Students are advised to rely on lecture notes as the main source of educational material. Lecture note contents are based on the following textbooks, each of which can be considered alone a textbook for this introductory course in cryptography.
- Katz J. and Lindell Y. (2020). Introduction to Modern Cryptography - CRC Press.
- Smart, P. Nigel. (2006). Cryptography made simple - Springer.
- Hoffstein J., Pipher J. and Silverman J.H. (2008). An introduction to mathematical cryptography - Springer.
- Unit Coordinator: Manuel Garcia-Villalba
- ECTS Credits: 6
- Semester: 1
- Year: 2
- Campus: Vienna University of Technology
- Language: English
- Aims:
To numerically simulate real fluid mechanical problems as well as to give an overview of the methods used in private and educational facilities.
- Content:
- Methods for a treatment of convection-diffusion equations,
- Projection methods for incompressible and compressible Navier-Stokes equations,
- Treatment of complex geomtries,
- Turbulence modelling.
- Pre-requisites:
Partial differential equations, fluid mechanics
- Reading list:
- Lecture notes,
- C. A. J. Fletcher: Computational techniques for fluid dynamics, vol. 1, Springer (1991)
- J. J. Ferziger, M. Peric: Computational methods for fluid dynamics, Springer (2002)
- Unit Coordinator: Martin Burger
- Programme: InterMaths
- ECTS Credits: 6
- Semester: 2
- Year: 1
- Campus: Hamburg University of Technology
- Aims:
This course will provide an introduction to some basic mathematical problems in image formation and image reconstruction. In addition to modelling forward problems, we consider classical regularization strategies, ensuring well-posedness of the image reconstruction problems. Beyond this classical setting, we dive into modern deep-learning methods, which allow solving inverse problems in a data-dependent approach. Finally, we also consider uncertainty quantification, where we employ the Bayesian view point of inverse problems.
- Content:
- Modelling forward problems
- Regularization strategies
- Convex optimization algorithms
- Deep-learning methods: post-processing strategies, learned regularization.
- Uncertainty quantification
- Pre-requisites:
Analysis, Linear Algebra, Basic Numerical Analysis and some programming skills
- Reading list:
-
Mueller, J. L., & Siltanen, S. (Eds.). (2012). Linear and nonlinear inverse problems with practical applications. Society for Industrial and Applied Mathematics.
- Benning, M., & Burger, M. (2018). Modern regularization methods for inverse problems. Acta numerica, 27, 1-111.
-
Natterer, F., & Wübbeling, F. (2001). Mathematical methods in image reconstruction. Society for Industrial and Applied Mathematics.
-
- Unit Coordinator: Przemyslaw Koprowski
- ECTS Credits: 4
- Semester: 2
- Year: 2
- Campus: University of Silesia in Katowice
- Language: English
- Aims:
The aim of Computational mathematics course is to teach students how to use computational (both numerical and symbolic) methods in applications coming from various branches of mathematics.
- Content:
The course covers the following subjects:
1. Polynomial algorithms: square-free factorization, polynomial factorization over finite fields, factorization of rational polynomials, monomial orders and Groebner bases;
2. Elimination theory: elimination with Groebner bases, classical elimination with resultants;
3. Inifinite summation and Gosper's algorithm;
4. Numerical integration: Monte-Carlo algorithm.
