1
Course Number: CSE/CSC C 411 Course Name: Cryptography
Credits: 3 (3-0-0) Contact hours per week = 3 hours
Instructor-in-charge: Dr. Purnendu Shekhar Faculty Associate(s)
Pandey
Aim of the course: The goal of this course is to understand the principles and practice of cryptography
algorithms and fundamentals of security protocols and technics. It covers cryptography, network-based security
threats and vulnerabilities, and practical solutions to system and network security.
Course Overview and Context: Cryptography is a seventh semester core course in computer science and
engineering undergraduate program. This course focuses on the principles and applications of cryptographic
techniques. This course will provide overview of classical encryption techniques, block ciphers and the data
encryption standard, finite fields, advanced encryption standard, confidentiality using symmetric encryption,
public-key cryptography, key management, hash and MAC algorithms, digital signatures, authentication
applications.
Topics of the Course
• Introduction to Security attacks, services and mechanism.
• Cryptography: basic concepts, cryptanalytic attacks, classical techniques and its cryptanalysis.
• Cryptography: symmetric algorithms, basic concepts and principles, block cipher modes of operation,
AES.
• Introduction to number theory.
• Cryptography: asymmetric algorithms (public-key cryptography), basic concepts and principles.
RSA.
• Key management.
• Message Authentication, Hash function and MAC Algorithm.
• Digital signature, Certificates, certificate authority.
2
Course Outcomes: At the end of the course the students should be able to
CO1 Understand a brief overview of computer security
CO2 Work with different classical encryption techniques
CO3 Understand confidentiality using symmetric encryption
CO4 Work with public-key cryptography and RSA
CO5 Understand key exchange and management
CO6 Work with message authentication, hash and MAC algorithms
CO7 Work with digital signatures and authentication protocols
Course Competencies: (Course Outcomes further elaborated) and Instruction schedule:
Competency CO CL No of
sessions
C1 Cryptography and basic terminologies, Security goals, Security attacks- CO1 U 3 sessions
Active and Passive, Services and Mechanisms.
C2 Conventional encryption model, Symmetric and CO1 U 4 sessions
Asymmetric
Encipherment, Classical encryption techniques-substitution ciphers and
transposition ciphers, Traffic confidentiality, Key distribution.
C3 Cryptanalysis, Stereography, Stream and block ciphers. Modern Block CO2 U 2 sessions
Ciphers: Block ciphers principals, Block cipher modes of operations.
C4 Introduction to AES, Key Generation and all the phases of AES. CO5 AP 3 sessions
C5 Introduction to prime and relative prime numbers, CO5 AP 3 sessions
Modular arithmetic, Fermat’s and Euler’s theorem, Euclid’s Algorithm,
C6 Principals of public key crypto systems, Application and requirements, CO6 AP 4 sessions
RSA algorithm, Security of RSA, Key management.
Understand and Apply the Diffie- Hellman key exchange algorithm
(Diffie-Hellman)
C7 Authentication requirements, Authentication functions, Message CO7 AP 4 sessions
authentication code, Hash function, birthday attacks, Security of hash
functions and MACS, Understand and Apply the theory of common
hashing function such as MD5, Secure hash algorithm (SHA).
C8 Digital Signatures, Authentication protocols digital signature standards, CO7 AP 2 sessions
Proof of digital signature algorithm.
C9 IP Security: Architecture, Authentication header, Encapsulating security CO8 AP 2 sessions
payloads, combining security associations, key management.
3
Learning Resources:
Textbook: William Stallings: Cryptography and Network Security, 7th Edition, Prentice-Hall / Pearson
Education, Englewood Cliffs /New Delhi, 2017.
Reference Books:
1. Michael Goodrich & Roberto Tamassia, “Introduction to Computer Security”, Prentice-Hall/ Pearson
Education, Englewood Cliffs/ New Delhi.
2. Behrouz A Forouzan, “Cryptography and Network security”, 3rd Edition, McGraw Hill Education.
3. Atul Kahate, “Cryptography and Network Security”, Tata McGraw Hill Education.
Note: Instructor will regularly post the necessary learning resources such as lecture resources, information
related to assignments etc., to the online course management portal i.e. LMS. Additional resources related
to software etc. will be provided on a timely basis.
Internet Links (annotated): Following are the online available resources:
MIT equivalent course (Network and Computer Security):
https://ocw.mit.edu/courses/electricalengineering-and-computer-science/6-857-network-and-computer-
security-spring-2014/index.htm
NPTEL equivalent course (Cryptography and Network Security): http://nptel.ac.in/courses/106105031/
Assessment Pattern: The final grade will be based on the marks / grades obtained in the mid-semester and
end-semester evaluation along with other assessments defined below. Relative grading method defined in
the academic regulations of the university will be followed to grade the students. Student has to secure
minimum 40% of marks after completing all the assessments in the following table to become eligible for
grading.
4
Student Responsibilities:
• Attend lectures in order to obtain all the course material that you are responsible for.
• Check announcements at LMS and emails on a regular basis.
• Submit assignments on time.
• Regularly, check your marks on the LMS and make sure they are up to date.
Attendance Policy: Students are expected to attend the classes regularly. Failure to attend the classes
regularly and adhere to the expected attendance percentage will result in a reduction of the grade as per the
University’s grading policy.
Assignments: Team wise practice problems will be posted in LMS as assignment. Each assignment will
have a deadline for submission in LMS and each assignment will carry 2% of weightage. Every student
should submit his/her assignment on or before the deadline given in LMS for that particular assignment.
Late assignment submission policy: Late submission in assignment is not allowed and any late submission
will be awarded “0” marks in that particular assignment.
Recourse examination policy: In case if a student fails in the course, one time recourse is permitted as per
University academic regulations. Recourse is allowed only for end examination (3 hours) with 40% weightage.
Make-up policy: No make-up work will be given for unexcused absences. The faculty needs to be informed
in advance in case the student is not going to be able to submit an assignment or take any evolution component,
and it is at the discretion of the faculty to sanction make up for an evaluation component.
Behavior expectations: No mobile phones and other distractive gadgets are permitted in the class.
Academic dishonesty/cheating/plagiarism: Plagiarism and dishonesty in any form in any evaluation
component will lead to appropriate disciplinary action.
