CS 60041 Cryptography and network security
Autumn 2003
L-T-P: 3-0-0, credits: 3

Class timings

Tuesday3:30 pm -- 5:25 pm
Wednesday1:30 pm -- 2:25 pm


Tentative syllabus (covered, not covered)

1. Basics (3 hours)
Basic objectives of cryptography, secret-key and public-key cryptography, one-way and trapdoor one-way functions, cryptanalysis, attack models.
2. Block ciphers (3 hours)
DES, multiple encryption, meet-in-the-middle attack, modes of operation.
3. Stream ciphers (3 hours)
Vernam's one-time pad, synchronous and asynchronous stream siphers, linear feedback shift registers, stream ciphers based on LFSR, insertion of non-linearity.
4. Message digest (3 hours)
Cryptographic hash functions and their desirable properties, keyed and unkeyed hash functions, MDC and MAC, Merkle's meta method, hash functions from block ciphers, custom-designed hash functions (MD and SHA families), birthday attack.
5. Public-key parameters (12 hours)
Review of discrete algebraic structures, modular arithmetic, GCD, primality testing, Chinese remainder theorem, quadratic residues, finite fields.
6. Intractable problems (4 hours)
Integer factorization problem, RSA problem, modular square root problem, discrete logarithm problem, Diffie-Hellman problem. Known algorithms for solving these intractable prolems.
7. Public-key cryptographic schemes (8 hours)
RSA encryption, Rabin encryption, ElGamal encryption. Diffie-Hellman key exchange. RSA signature, Rabin signature, ElGamal signature, DSA. Blind and undeniable signatures. Passwords, challenge-response algorithms, zero-knowledge protocols.
8. Cryptanalysis in practice (3 hours)
Side channel attacks: timing attacks, power attacks, fault attacks. Backdoor cryptanalysis.
9. Quantum computation and cryptography (4 hours)
Postulates of quantum mechanics, quantum computation, quantum key exchange, Shor's poly-time quantum algorithms for integer factorization and discrete logs.
10. Network issues (3 hours)
Certification, public-key infrastructure, secured socket layer, Kerberos.


[DVM] Abhijit Das and C. E. Veni Madhavan, book under preparation, excerpts will be given to the students.
[DK] Hans Delfs and Helmut Knebl, Introduction to cryptography: Principles and applications, Springer International Students' Edition, 2002.
[Koblitz] Neal Koblitz, A Course in Number Theory and Cryptography, Springer International Students' Edition, 2nd edition, 1994.
[HAC] Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
[Schneier] Bruce Schneier, Applied Cryptography, 2nd edition, John Wiley & Sons, 1996.
[Stallings] William Stallings, Cryptography and network security: Principles and practice, 3rd edition, Prentice Hall, 2003.
[Stinson] Douglas R. Stinson, Cryptography: Theory and practice, 2nd edition, CRC Press, 2002. Also visit the URL for first edition.

[DVM] will be followed for topics 1 and 5--12. For symmetric-key techniques look at [HAC] or [Stinson].

Test schedule

TestPlace and TimeWeightageDuration SyllabusQuestionsAnswers
Class test I Clubbed with the Mid-Semester Exam
Mid-semester exam CSE 120, Sep 20,
40% 2 hrs + Topics 1-4,
beginning of 5
[pdf]  [ps.gz] [pdf]  [ps.gz]
Class test II Clubbed with the End-Semester Exam
End-semester exam CSE 107+108,
Nov 22, 2:00-5:00pm
60% 3 hrs + Topics 5-7 [pdf]  [ps.gz] [pdf]  [ps.gz]