CS 4990 /6990
Cryptography and Information Security
Solutions to Quiz 2
Syllabus
- Elementary Number Theory
- Fundamental Theorem of Arithmetic
- lcm, gcd
- Euclidean Algorithm for gcd
- Extended Euclidean Algorithm
- Modular Arithmetic
- Groups, Abelian Groups, Rings and Fields
- Modular Inverses
- Chinese Reminder Theorem
- Modular Matrix Inversion
- Classical Cryptography
- Substitution Cipher
- Hill Cipher
- Vignere Ciphere
- Permutation Cipher
- Cryptanalysis of Classical Ciphers
- Theoretical Foundations
- Perfect Secrecy
- One-time pad
- Entropy
- Confusion and Diffusion
- Symmetric Cryptography
- Product Cryptosystems
- Substitution-Permutation Networks
- Fiestel Ciphers
- DES, AES
- Overview of Linear and Differential Cryptanalysis
- Stream Ciphers
- Block Cipher Modes - ECB, CFB, CBC, OFB
- Double DES and Triple DES
- Hash Functions
- Preimage resistance and Collision Resistance
- Compression Function
- Merkle-Damgard Construction
- SHA
- Hash Functions as Block Ciphers
- Block Ciphers as Hash Functions
- Message Authentication Codes
- Key Distribution and Authentication
- Basic Key Distribution
- Diffie-Hellman
- Blom's Key Predistribution
- Authentication with a shared secret
- Kerberos
- Authentication with a "weak" secret
- EKE
- Advanced Topics in Number Theory
- Euler-Phi Function
- Fermat's Little Theorem
- Euler-Fermat Theorem
- Quadratic Congruences
- Quadratic congruences modulo a prime.
- Quadratic congruences modulo composites.
- Quadratic congruences and Factorization
- Factorization
- Fermat's Factorization
- Pollard's p-1 Factorization
- Dixon's Random Squares and Quadratic Seives
- Primality Testing
- Using Fermat's Little Theorem
- Miller-Rabin
- Exponential Congruences
- Order of elements in a field
- Generators
- Discrete logs
- Algorithms for Discrete Log
- Pohlig-Hellman
- Index Calculus Method
- Cryptosystems based on Infeasibility of Factoring
- RSA
- Square and Multiply Algorithm
- System renewal with compromised private key
- Small exponent RSA
- Common modulus RSA
- Rabin Cryptosystem
- Cryptosystems based on Infeasibility of the Discrete Log Problem
- Diffie-Hellman
- Massey-Omura
- El Gamal
- Signature Schemes
- El Gamal Signature Scheme
- Schnorr Signature Scheme
- DSA
- Brief Overview of Elliptic Curve Cryptosystems
Assignments
Assignment 1
Assignment 2
- Unzip "ciphertext.zip"
- Choose the ascii file with your LASTNAME.txt
- Break the Vignere Cipher encoded text
- Email me the plaintext and the key used for the cipher
Assignment 3 - Problems 1.11, 1.22 and 3.4
Assignment 4
Assignment 4 Solutions!
Assignment 5
Assignment 5 Solutions!
Assignment 6
Assignment 3A
Assignment 7
Lecture Handouts
Number Theory Foundations for Asymmetric Cryptography Updated 13 November 2003.
Number Theory Foundations for Asymmetric Cryptography Updated 18 November 2003.