Algorithmic complexity and cryptography - KAIN7M04

  • Number of hours

    • Lectures 15.0
    • Projects -
    • Tutorials 15.0
    • Internship -
    • Laboratory works -
    • Written tests 2.0

    ECTS

    ECTS 0.5

Goal(s)

A: Cryptography and Complexity

  • Introduction to basic principles of cryptography: secret and public jeys, algorithms and protocols
  • Understand the principles behind cryptosystems and their uses
    B: Graphs and Complexity
    We introduce graph theory, with a focus on complexity analysis, Modeling, Reasoning with graphs, and Algorithmic.

Content(s)

A :
1. Computations modulo an integer.
2. Symmetric-key cryptography.
3. Public-key cryptography.

B :
0) basic vocabulary and representation of graphs
1) reasoning with graphs (both directed and undirected) and the different classes: bipartite, planar, acyclic, eulerian, hamiltonian.
2) Presentation of classic algorithms and their complexity: connectedness, strong connectedness and DFS, Dijkstra and BFS,
Kruskal, max-flow
3) Examples of modelling with graphs
4) A great number of decision problems on graphs and their complexity classes.

Prerequisites

A: None
B: Basics of Algorithmics

Test

CC, EXAM

Calendar

The course exists in the following branches:

  • Curriculum - INFO - Semester 7

Additional Information

Course ID : KAIN7M04
Course language(s): FR

You can find this course among all other courses.

Bibliography

Wikipedia. Portail de la Cryptographie.