Person in charge: | (-) |
Others: | (-) |
Credits | Dept. |
---|---|
7.5 (6.0 ECTS) | MAT |
Person in charge: | (-) |
Others: | (-) |
Upon finishing this subject, students should:
- Be familiar with the basic principles (especially those related to public key cryptography) underlying the most important techniques in cryptography: symmetrical and asymmetrical coding-decoding and the digital signature.
- Understand the most important algorithms behind each of the relevant techniques, especially those used in the most commonly-accepted standards.
- Be familiar with some of the applications of cryptography.
Estimated time (hours):
T | P | L | Alt | Ext. L | Stu | A. time |
Theory | Problems | Laboratory | Other activities | External Laboratory | Study | Additional time |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
9,0 | 0 | 12,0 | 0 | 12,0 | 9,0 | 0 | 42,0 | |||
- Block encryption, flow encryption. - The Data Encryption Standard: Description, History, Standardisation, Cryptanalysis. - The Advanced Encryption Standard: Description, Standardisation. - Operation modes for block-encrypted systems. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
18,0 | 0 | 12,0 | 0 | 12,0 | 18,0 | 0 | 60,0 | |||
- Multi-precision arithmetic operations. Euclidean algorithms.
- Congruences, multiplication group, modular arithmetic, modular exponential, Chinese Remainder Theorem. - Calculation of square roots. - Prime numbers, probabilistic criteria of primeness, random generation of prime numbers. - Factorising integers, current state of the problem and the outlook in this field. - Concepts behind the unidirectional trap-door function. - Power function trap-door. - Discrete exponential function and the discrete algorithm problem. Finite body variants. - The knapsack problem. - RSA cryptosystem (Rivest, Shamir, Adleman). - ElGamal cryptosystem. - Diffie-Hellman system for distributing keys. - Knapsack cryptosystem. Shamir"s cryptanalysis. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
3,0 | 0 | 4,0 | 0 | 4,0 | 3,0 | 0 | 14,0 | |||
- Cryptographic hash functions. Secure Hash Standard. - Digital signatures: RSA and DSA - Public key certificates. - Certifying authorities. - PKI |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
12,0 | 0 | 2,0 | 0 | 2,0 | 12,0 | 0 | 28,0 | |||
- Encryption and decryption transformations. Mixed private key - public key techniques. - Identification schemes and protocols. - SSL. - SET. - Micro-payments. - Shared secrets. - Electronic voting. - Watermarks. Others aspects of cryptography: - Standardisations. Bodies involved. - Patents. - Policy aspects. Government control. - The Telecommunications Act. - The Digital Signature Act. - International Laws. |
Total per kind | T | P | L | Alt | Ext. L | Stu | A. time | Total |
45,0 | 0 | 30,0 | 0 | 30,0 | 45,0 | 0 | 150,0 | |
Avaluation additional hours | 0 | |||||||
Total work hours for student | 150,0 |
Theory classes and exercises.
The nature of the theme under consideration will determine the scheduling of problems and theory.
Lab classes will consolidate students" knowledge.
The grade (out of 10) is calculated by adding the following:
* Lab exercise (4 points).
* Final exam (6 points).
Students are recommended to take this course a few terms before completing the Selection Stage.