Mtech CR S
Mtech CR S
Mtech CR S
M.Tech in Cryptology and Security is a two year program offered in the Kolkata center
of the Indian Statistical Institute. The course is designed to impart in-depth theoretical
and practical knowledge in the area of cryptology and information security. It is designed
to provide the basic background in mathematics, statistics and computer science followed
by specialized instructions on various theoretical and practical aspects of the field.
The students on successful completion of the course, may take up
• an academic career to further study and research in theoretical and practical aspects
of cryptology, information security and related disciplines.
Semester 1
In semester 1 there would be two pools of courses. A student have to take all two courses
in Pool A and three courses from Pool B. The Pool B courses which a student is required
to take would be decided by a faculty advisor based on the background of the student.
Pool A
Pool B
1
Semester 2
2. Cryptology
Semester 3
1. Advanced Cryptology
4. Elective 1
5. Elective 2
Semester 4
2. Topics in Privacy
3. Topics in Security
4. Topics in Cryptology
Discrete Mathematics
References:
1. Jiři Matoušek, Jorosalav Nešetřil : Invitation to Discrete Mathematics, 2nd ed., Ox-
ford University Press, 2006.
9. Reingold et al.: Combinatorial Algorithms: Theory and Practice, Prentice Hall, En-
glewood Cliffs, 1977.
10. J. A. Bondy and U. S. R. Murty: Graph Theory with Applications, Macmillan Press,
London, 1976.
12. L. Zhongwan: Mathematical Logic for Computer Science, World Scientific, Singapore,
1989.
References:
1. Sipser: Introduction to The Theory of Computation, PWS Pub. Co., New York, 1999.
2. Operating Systems:
References:
1. Z. Kohavi: Switching and Finite Automata Theory, 2nd ed., McGraw Hill, New York,
1978.
2. J. P. Hayes: Computer Architecture and Organization, 2nd ed., McGraw Hill, New
York, 1988
3. P. Pal Choudhury: Computer Organization and Design, Prentice Hall of India, New
Delhi, 1994.
4. M. M. Mano: Computer System Architecture, 3rd ed., Prentice Hall of India, New
Delhi, 1993.
10. S. E. Madnick and J. J. Donovan: Operating Systems, McGraw Hill, New York, 1974.
2. Rings and fields: Rings, Ideals, maximal ideals, quotient rings, Integral domains,
principal ideal domain(PID), Euclidean domain(ED), ring of integers as example of
PID and ED, Euclidean algorithm for GCD, extended Euclidean algorithm, finding
modular inverse of an integer, Chinese Remainder Theorem(CRT), Euler’s φ-function,
quadratic residues.
4. Vector spaces: subspaces, linear independence, basis, dimension, direct sum and com-
plement, isomorphism
5. Linear transformation and matrices, algebra of matrices, rank and inverse, normal
forms
References:
1. D. F. Stanat and D. E. McAllister: Discrete Mathematics in Computer Science, Pren-
tice Hall, Englewood Cliffs, 1977.
3. L. L. Domhoff and F. E. Hohn: Applied Modem Algebra, Macmillan, New York, 1978.
6. G. Birkhoff and S. McLane: A Survey of Modem Algebra, 4th ed. Macmillan, New
York, 1977.
7. D. Burton: Elementary Number Theory, 7th ed., McGraw Hill Education, 2017.
1. Probability Theory
2. Statistics
References:
1. Data Structures
References:
5. E. Horowitz and S. Sahni: Fundamentals of Data Structures, CBS, New Delhi, 1977.
6. R. L. Kruse: Data Structures and Program Design in C, Prentice Hall of India, New
Delhi, 1996.
7. A. Aho, J. Hopcroft, and J. Ullman: Data Structures and Algorithms, Addison-
Wesley, Reading, Mass., 1983.
9. P. E. Livadas: File Structure: Theory and Practice, Prentice Hall, New Jersey, 1990.
11. S. Sahani: Data Structure, Algorithms and Applications in JAVA, McGraw Hill, New
York, 2000.
12. Wood: Data Structure, Algorithms and Performance, Addison-Wesley, Reading, Mass.,
1993.
15. B. W. Kernighan and R. Pike: The Unix Programming Environment, Prentice Hall
of India, 1996.
1. Complexity measure and asymptotic notations, worst, best and average case analysis.
6. Graph algorithms.
7. NP-completeness.
References:
2. A. Aho, J. Hopcroft and J. Ullman; The Design and Analysis of Computer Algorithms,
A. W. L, International Student Edition, Singapore, 1998
8. D. E. Knuth: The Art of Computer Programming, Vol. 1, Vol. 2 and Vol. 3. Vol. 1,
2nd ed., Narosa/Addison-Wesley, New Delhi/London, 1973; Vol. 2: 2nd ed., Addison-
Wesley, London, 1981; Vol. 3: Addison-Wesley, London, 1973.
Cryptology
1. Classical ciphers
3. Stream ciphers
4. Block ciphers
6. Formal models for block and stream ciphers: Pseudorandom generators, Pseudoran-
dom functions and permutations
7. Symmetric key encryption: Notion of CPA and CCA security with examples.
11. Introduction to public key encryption, computational security and computational as-
sumptions.
References:
1. Jonathan Katz, Yehuda Lindell: Introduction to Modern Cryptography, Chapman &
Hall/CRC, 2007.
2. Douglas R. Stinson: Cryptography Theory and Practice, 3rd ed., Chapman & Hall/CRC,
2006.
3. Dan Boneh, Victor Shoup: A Graduate Course in Applied Cryptography, online draft
available at http://toc.cryptobook.us/.
1. Information Theory:
2. Coding Theory:
References:
9. V. Pless: Introduction to the Theory of Error Correcting Codes, 3rd ed., John Wiley,
New York, 1982.
1. Computer Networks:
References:
2. W. Stallings: ISDN and Broadband ISDN With Frame Relay and ATM, Prentice Hall,
Englewood Cliffs, 1995.
3. W. Stallings: Local and Metropolitan Area Networks, 4th ed., Macmillan, New York,
1993.
10. R. Ramakrishnan: Database Management Systems, 2nd ed., McGraw Hill, New York,
1999.
2. Anatomy of an Attack:
Network Mapping using ICMP queries, TCP Pings, traceroutes, TCP and UDP port
scanning, FTP bounce scanning, stack fingerprinting techniques, Vulnerability scan-
ning, System and Network Penetration, Denial of Service.
References:
1. Ross Anderson: Security Engineering, 2nd ed., Wiley. Available online: http://www.
cl.cam.ac.uk/~rja14/book.html.
2. C.P. Pfleeger, S.L. Pfleeger, J. Margulies: Security in Computing, 5th ed., Prentice
Hall, 2015.
Advanced Cryptology
References:
3. Dan Boneh, Victor Shoup: A Graduate Course in Applied Cryptography, online draft
available at http://toc.cryptobook.us/.
5. Rafael Pass and Abi Shelat: A Course in Cryptography, Lecture notes. Available
online: https://www.cs.cornell.edu/courses/cs4830/2010fa/lecnotes.pdf
3. Database Security:
References:
1. Ross Anderson: Security Engineering, 2nd ed., Wiley. Available online: http://www.
cl.cam.ac.uk/~rja14/book.html.
2. C.P. Pfleeger, S.L. Pfleeger, J. Margulies: Security in Computing, 5th ed., Prentice
Hall, 2015.
This course would be project based, by the end of the course each student should do two
non-trivial implementation projects in the following broad areas:
1. Cryptographic Implementations:
2. Security Implementations:
References:
3. Quantum Entanglement.
4. Quantum Teleportation.
5. Super-dense coding.
7. Quantum search.
8. Shor’s factoring algorithm and its implication towards security in quantum world.
References:
Topics in Privacy
3. Differential privacy
4. De-anonymization techniques
6. Applications: Mixnets, Onion Routing (TOR), e-cash, e-voting, location privacy, pro-
filing
References:
1. Cynthia Dwork, Aaron Roth: The Algorithmic Foundations of Differential Privacy
(Foundations and Trends in Theoretical Computer Science).
3. Rafael Pas and abi shelat, A Course in Cryptography, Lecture notes. Available online:
https://www.cs.cornell.edu/courses/cs4830/2010fa/lecnotes.pdf
Topics in Security
1. Digital Forensics
3. Biometrics
References:
1. Gerard Johansen: Digital Forensics and Incident Response, Packt Publishing Limited
2017
Topics in Cryptology
In depth study in some contemporary and emerging areas in cryptology. The list will be
updated from time to time. Topics may include but not limited to
4. Homomorphic Encryption
5. Cloud Cryptology
6. Authenticated encryption
References:
3. Dan Boneh, Victor Shoup: A Graduate Course in Applied Cryptography, online draft
available at http://toc.cryptobook.us/.
7. Finding generators and discrete log in Zp∗ . Diffie-Hellman key exchange. Testing
quadratic residuosity. Computing modular square root. Quadratic residuposity as-
sumption.
References:
This course would provide introduction to basic techniques and tools of machine learning
and would include a few case studies of using these techniques in security applications.
1. Supervised Learning
2. Unsupervised learning
References:
3. Trevor Hastie, Robert Tibshirani: The Elements of Statistical Learning: Data Mining,
Inference, and Prediction, Springer, 2009.
This course will provide introduction to blockchains and cryptocurrencies including Bitcoin
and contracts. Basic tools will be introduced first, followed by implementation of practical
blockchain protocols.
5. Smart contracts
References:
3. Web Resources.
1. History of Cryptology/Security
5. Indian Cyber Law: (i) Information Technology Law in India (ii) Selected Cyber Law
Cases (iii) Selected Adjudicating Officer Orders (iv) Data Privacy Law in India (v) IT
Act Audit & Compliance (vi) Documentation Issues (vii) International Cyber Crime
Law (viii) Emerging Issues in Cyber Law.
6. Various facets of Cyber Crime and Investigation
7. Copyright management
9. Electronic voting.
References:
1. Ross Anderson: Security Engineering, 2nd ed., Wiley. Available online: http://www.
cl.cam.ac.uk/~rja14/book.html.
3. Whitfield Diffie and Susan Landau: Privacy on the Line The Politics of Wiretapping
and Encryption, MIT Press, 2007
4. Helen Nissenbaum: Privacy in Context: Technology, Policy, and the Integrity of Social
Life, Stanford University Press, 2009.