Instructor : Dr. Ahmed Desoky
Professor of CECS
Phone : (502) 852 – 0473
E-mail : ahd@louisville.edu
Prerequisites :
CECS 310 and IE 360
Description : This course gives a historical introduction to cryptology and the science of secret codes. The first part covers substitution ciphers, transposition codes, Vigenere cipher, and more complex polyalphabetic substitutions including those created by rotor machines. The second part describes bit block cipher schemes such as Data Encryption Standard (DES). Public key encryption is the subject of the final part including RSA, Knapsack codes, and Diffie-Hellman key exchange.
Objectives : To provide students with the knowledge and understanding of the encryption, decryption, and attack algorithms and techniques used in cryptology. To teach the mathematical underpinnings of cryptology such as number theory, congruences, finite fields, finding large prime numbers, pseudo primes, and primality testing
Text : Paul Garrett, Making, Breaking Codes; an Introduction to Cryptology, Prentice Hall, 2001.
ISBN: 0-13-030369-0.
Schedule :
1. Cryptography: Simple Ciphers, cryptograms (5 classes)
2. Transposition Ciphers and Permutations (5 classes)
3. Vigenere Cipher, Hill Cipher (5classes)
4. Cryptanalysis: attacks on encrypted messages. Probabilistic methods, plaintext, and chosen text techniques. (5 classes)
5. Rivest-Shamir-Adleman (RSA), Diffie-Hellman, Knapsack., and Elliptic Curve Protocols (8 classes)
6. Number Theory: congruences, multiplicative inverses. (4 classes)
7. Finite groups and Finite Fields (4 classes)
8. Finding large prime numbers, pseudo primes, and primality testing (4 classes)
9. Tests (2 classes)
Grading Policy :
Individual term paper - 25%
2 Tests - 50%
Programming projects - 15%
Homework - 10%
