CS547 Cryptography and Data Security
Objectives:
Discover how Alice may send a secret message to Bob
that nobody else can understand,
how he may be certain that this message came from Alice,
how she can prove him a theorem with revealing anyhting about
the proof (!),
how they can flip a coin over the phone,
how they can play a fair game of poker over the phone,
how they can decide if their are a match without disclosing they
selection criteria to each other,
and how other similar security tasks may be achieved using cryptography.
Course outline:
-
Introduction; basic concepts of cryptography;
Simple cryptographic systems.
-
Information theory,
Unicity distance.
-
ENIGMA, DES, elements of cryptanalysis.
-
Authentification Codes.
-
public key-exchange ; Diffie-Helmann system.
-
Public-Key Cryptography; RSA, ElGamal, and others.
-
Pseudo-random number generators ; Blum-Goldwasser cryptosystem.
-
Signature schemes; RSA, Rabin, ElGamal, DSS and others.
-
Cryptographic Hash Functions; MD4, MD5 and others.
-
Quantum Cryptography.
-
Bit commitment and Zero-Knowledge proofs.
-
Secret Sharing, Oblivious Transfer, multi-party computations...
Evaluation:
We'll see . . .