E0 235 Cryptography
Prof C.E.Veni Madhavan
Course website
Topics covered
- Introduction
- Elementary Number Theory
- Group, Fields and Integers
- Complexity and hard problems
- Euclid's algorithm
- Euler's totient function
- Fermat's little theorem
- Chinese remainder theorem
- Hensel's lemma
- Quadratic residues
- Polynomial rings
- Finite fields
- Integer factoring
- Public-key Cryptography (Block)
- RSA algorithm
- Deffie-Hellam key exchange
- ElGamal encryption
- Knapsack cryptosystem
- Digital Signatures
- RSA based scheme
- Rabin signature scheme
- ElGamal signature scheme
- Digital Signature Standard
- Schemes with message recovery
- Elliptic curves and cryptography
- Pseudorandom Number Generators
- Statistical tests
- Blum Blum Stub generator
- Linear feedback shift register
- Public-key Cryptography (Stream)
- Goldwaser Micali encryption scheme
- Blum Goldwaser encryption scheme
- Primality test
- Carmichael number
- Miller Rabin test
- AKS algorithm
- Private-key Cryptography (Stream)
- Nonlinearity of boolean functions
- LFSR based systems
- Private-key Cryptography (Block)
- Cryptanalysis (intro)
- DES
- IDEA
- RC5
- AES
Texts and references
- Menezes, Oorschot and Vanstone, Handbook of Cryptography [ ebook ]
- Koblitz, A course in Number theory and Cryptography
- Chapters from the book by Abhijit Das and CEVM (available from course website)
Assignments
Exams
Links