Politechnika Warszawska - Centralny System Uwierzytelniania
Strona główna

Cryptography and Data Security

Informacje ogólne

Kod przedmiotu: 1030-IN000-MSA-0586
Kod Erasmus / ISCED: (brak danych) / (brak danych)
Nazwa przedmiotu: Cryptography and Data Security
Jednostka: Wydział Matematyki i Nauk Informacyjnych
Grupy: Elective courses, Computer Science
Przedmioty obieralne, wydz. MiNI PW
Punkty ECTS i inne: (brak) Podstawowe informacje o zasadach przyporządkowania punktów ECTS:
  • roczny wymiar godzinowy nakładu pracy studenta konieczny do osiągnięcia zakładanych efektów uczenia się dla danego etapu studiów wynosi 1500-1800 h, co odpowiada 60 ECTS;
  • tygodniowy wymiar godzinowy nakładu pracy studenta wynosi 45 h;
  • 1 punkt ECTS odpowiada 25-30 godzinom pracy studenta potrzebnej do osiągnięcia zakładanych efektów uczenia się;
  • tygodniowy nakład pracy studenta konieczny do osiągnięcia zakładanych efektów uczenia się pozwala uzyskać 1,5 ECTS;
  • nakład pracy potrzebny do zaliczenia przedmiotu, któremu przypisano 3 ECTS, stanowi 10% semestralnego obciążenia studenta.

zobacz reguły punktacji
Język prowadzenia: angielski
Skrócony opis:

Course description:

The main aim of the lecture is introduction to cryptographic methods in computer systems and computer networks.

Ciphers, cryptographic protocols, private and public key cryptography, digital signatures, hash functions are main

stream of the lecture. The conspectus of the lecture is similar to the Polish version.

Pełny opis:

Course description:

The main aim of the lecture is introduction to cryptographic methods in computer systems and computer networks.

Ciphers, cryptographic protocols, private and public key cryptography, digital signatures, hash functions are main

stream of the lecture. The conspectus of the lecture is similar to the Polish version.

Lecture

contents

1. Mathematical background (number theory, abstract algebra, complexity theory). (computations in finite fields

and rings i.e. modular computations, congruencies, finite fields commutative rings, Euler's theorem, GCD and

extended Euclid's algorithm, probabilistic and deterministic primality tests, Miller-Rabin's algorithm, primes

generation, computational complexity and NP hard problems (integer factorization problem, discrete logarithm

problem, Diffi -Hellmann's problem).

2. Cryptography - basic terminology and concepts ("objectivies and primitivies", alphabet, language, code,

Hamming distance, cipher, cryptographic systems, different kinds of ciphers, block ciphers, stream ciphers,

3. Classical ciphers (Cesear, Playfair, Vigenaire, Vernam, Enigma, ideal ciphers, substitution ciphers,

transposition ciphers, product ciphers)

4. Symmetric cryptography and block ciphers (Feistel's architecture, round, S-box, avalanche effect, DES,

DES S-boxes, 3DES, DESX, IDEA, FEAL, Lucipher, MARS, CAST 256, SAFER, RC5, AES-Rijndael,

Twofish, Blowfish)

5. Public key ciphers ( RSA, Rabin's cipher, ElGamal's cipher, McEliece's cipher, knapsack ciphers (Merkle-

Hellman and Chore-Rivest), probabilistic ciphers, cryptographic systems based on elliptic curves, generation of

public key ciphers parameters)

6. Elliptic curves an cryptographic systems based on elliptic curves (ciphers 6. and digital signatures)

7. Stream ciphers and ciphering modes (stream ciphers based on LFSRs, ECB, CBC and so on)

8. Hash functions and data integrity. (properties and classification of hash functions relationships between

properties), keyed hash functions (MACs), unkeyed hash functions (MDCs), hash functions: MD5, SHA-1 and

so on, Chaum-van Heijst - Pfitzmann's hash functions, MACs based on block ciphers, Davis method and so on)

9. Identification and Entity Authentication (passwords - weak authentication, challenge -response

authentication - strong authentication, zero-knowledge proofs, zero-knowledge identification protocols)

10. Documents Authentication - digital signatures. Basic digital signatures properties, different kinds of digital

signatures, digital signatures based on RSA, ElGamal's digital signatures, DSS standard, digital signatures based

on entity authentication protocols (Fiat'a-Shamir, Schnorr, Guillou-Quisquater's protocols), blind digital

signatures

11. Cryptographic Protocols (wide mouth frog protocol, Yahalom protocol, time stamping and so on)

12. Key distribution protocols (Diffi-Hellmann protocols, TTP and so on)

13. Key management, public key infrastructure - PKI, CA – organization

14. Random and pseudorandom numbers generators for cryptographic aims.

15. Attacks on cryptographic systems and elements of cryptoanalysis (linear cryptoanalysis, differential

cryptoanalysis and so on)

16. Fast implementations of cryptographic algorithms (fast algorithms for multiple -precision residual and

integer arithmetic, fast exponentiation, fast GCD computations, specialized hardware solutions)

Project:

Special sets of problems and individual projects are prepared for students.

Literatura:

Basic literature:

1. A.Menezes, P.van Oorsschot, S.Vanstone; Handbook of Applied Cryptography; CRC Press 1996.

2. N.Koblitz; A course in Number Theory and Cryptography; Springer Verlag, 1994.

3. N.Koblitz; Algebraic aspects of Cryptography; Springer Verlag, 1998.

4. B.Schneier; Applied Cryptography ; Wiley, 1996.

5. T.Cormen, C.Leiserson, R.Rivest; Introduction to Algorithms; MIT 1994.

Summary The main aim of the lecture is introduction to cryptographic methods in computer systems and computer networks.

Ciphers, cryptographic protocols, private and public key cryptography, digital signatures, hash functions are main

stream of the lecture. The conspectus of the lecture is similar to the Polish version.

Przedmiot nie jest oferowany w żadnym z aktualnych cykli dydaktycznych.
Opisy przedmiotów w USOS i USOSweb są chronione prawem autorskim.
Właścicielem praw autorskich jest Politechnika Warszawska.
pl. Politechniki 1, 00-661 Warszawa tel: (22) 234 7211 https://pw.edu.pl kontakt deklaracja dostępności USOSweb 7.0.2.0-2 (2024-03-29)