School / Prep
ENSEIRB-MATMECA
Internal code
EIN8-SECU1
Description
After a few rudiments in Number Theory and Complexity Theory, this introductory course presents a wide variety of protocols and studies the security of some of them.
Outline
Introduction to protocols - Introduction - Secret-key cryptosystems
Protocol security - Complexity-theoretic difficulties - Public-key systems - Some easy arithmetic problems - Some difficult arithmetic problems
Examples of protocols - Pledging protocol - Signature and authentication - Null-disclosure proof - Electronic payment and voting
Perspectives - Quantum cryptology
Teaching hours
- CMLectures14,66h
- TDTutorial16h
- TIIndividual work20h
Mandatory prerequisites
[[m:IF101]], [[m:IF102]], [[m:IF106]]
Syllabus
I. Introduction to protocols
- Introduction
- Cryptosystems with secret keys
II. Protocol security
- Difficulty in Complexity Theory
- Public-key systems
- Some easy arithmetic problems
- Some difficult arithmetic problems
III. Examples of protocols
- Pledging protocol
- Signature and authentication
- Zero-disclosure proof
- Electronic payment and voting
IV. Outlook
- Quantum cryptology
Assessment of knowledge
Initial assessment / Main session - Tests
Type of assessment | Type of test | Duration (in minutes) | Number of tests | Test coefficient | Eliminatory mark in the test | Remarks |
---|---|---|---|---|---|---|
Integral Continuous Control | Continuous control | 1 |