Department of Computer Science
Lesson's Description  |
Prerequisite:
none
|
|
Course Credits: 3 |
|
Teaching
Hours : Monday (11:00 - 12:00) (Room Theta 201)
Wednesday (9:00 - 11:00) (Room Theta 201)
|
|
Subject: This course covers: |
I. Classical Cryptography, Study of the following cryptosystems (Affine, Substitution, Shift, Vigenere, Hill, Permutation, and Stream).Cryptananalysis of the above cryptosystems.
II. RSA systems and Factoring. Introduction to the Public key Cryptography. The RSA cryptosystem, Attacs on RSA factoring Algoritms, Signature Schemes.
III. The El Gamal Signature Scheme Finite fields and Elliptic Curves systems Knapsack
IV. Signatures.
Course's Index
:
Lectures
|
Lecture 1 |
|
Lecture 2-3 |
|
Lectures 4-5 |
|
Lecture 6 (Example) |
|
Lecture 7 |
|
Lecture 8 |
|
Lecture 9 |
|
Lecture10 |
|
Lecture11 |
|
Lecture12 |
|
Lecture13 |
|
Example (Shanks algorithm Implemention) |
|
Lecture14 |
|
Lecture15 |
|
Lecture16 |
Links
|
A simple applet to cipher and decipher a message according the Substitution Ciphering System |
|
Matfiles conserning affine Cryptosystem, Square and Multiply algorithm, ôïí Extended Eucleidian Algorithm |
|
Rsa algorithm in Java and in Visual Basic. |
|
Pohlig - Hellman Algorithm in Visual Basic |
http://www.cacr.math.uwaterloo.ca/hac
Exercises
|
Exersice 1 (Deadline Wednesday 28 February) |
|
Exersice 2 (Deadline Wednesday 7 March) |
|
Exersice 3 (Deadline Wednesday 14 March) |
References
This
web page was created by Diomedes Kastanis and Pelagia Konstantaki:
email
him at: dkastani@csd.uoc.gr
email
her at: pelconst@csd.uoc.gr
best viewed with
Heraclion 2000-2001
Last updeated 30 March 2001