MANIPAL UNIVERSITY JAIPUR

Department of Computer Science and Engineering

Course Hand-out

A. Basic Details:
Programme Name: Bachelor of Technology
Course Name: Cryptography
Course Code: CSE2221
LTPC (Lecture Tutorial Practical
3104
Credits):
Session: January – May, 2025
Class: Semester – IV
Course Coordinator: Prof. (Dr.) Umashankar Rawat
Dr. Satyabrata Roy, Dr. Aditya Sinha, Dr.
Course Instructor(s):
Ankur Pandey, Dr. Juhi Singh, Dr. Pallavi
Additional Practitioner(s) – if any
(Industry Fellow/ Visiting Faculty/ Adjunct To be identified and appointed later
Faculty, etc.):

B. Introduction: This course, offered by the Department of Computer Science &

Engineering, introduces students to the fundamentals of cryptography and its role in
securing information systems. Aimed at aspiring information security professionals,
it covers essential topics like encryption techniques, cryptographic algorithms, hash
functions, and secure communication protocols. Students will learn to apply
cryptographic principles to ensure data confidentiality, integrity, and authenticity
while exploring real-world applications. The course provides a strong foundation in
designing and analyzing secure systems, preparing students for advanced studies or
careers in cybersecurity and related fields.
C. Course Outcomes:

Target Target
CO Statement CO Level Attainment Attainment
% level
Illustrate the fundamentals of 2
1 ≥ 80 3
cryptography (Understand)
Solve problems using mathematical 3
concepts in cryptographic 2 ≥ 70% < 80% 2
(Apply)
techniques
Demonstrate the use of symmetric 2
encryption algorithms such as DES, 3 ≥ 80 3
(Understand)
AES, and their modes of operation
Utilize public-key techniques such
as RSA, Diffie-Hellman, and Elliptic 3
4 ≥ 80 3
Curve Cryptography for secure key (Apply)
exchange and encryption
Demonstrate secure communication 2
5 ≥ 70% < 80% 2
and authentication techniques (Understand)

Information about attainment levels:

Attainment (%) Level
< 60 % 0
≥ 60% < 70% 1
≥ 70% < 80% 2
≥ 80 3

D. Program Outcomes and Program Specific Outcomes:

[PO.1]. Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the solution
of complex engineering problems.

[PO.2]. Problem analysis: Identify, formulate, research literature, and analyze

complex engineering problems reaching substantiated conclusions using
first principles of mathematics, natural sciences, and engineering sciences.

[PO.3]. Design/development of solutions: Design solutions for complex

engineering problems and design system components or processes that
meet the specified needs with appropriate consideration for the public
 health and safety, and the cultural, societal, and environmental
considerations.
[PO.4]. Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid
conclusions.
[PO.5]. Modern Tool Usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations.
[PO.6]. The Engineers and Society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal, and cultural issues and
the consequent responsibilities relevant to the professional engineering
practices.
[PO.7]. Environment and Sustainability: Understand the impact of the
professional engineering solutions in societal and environmental contexts,
and demonstrate the knowledge of, and need for sustainable development.
[PO.8]. Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practices.
[PO.9]. Individual and Team Work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
[PO.10]. Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such as,
being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear
instructions.
[PO.11].Project Management and Finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
 [PO.12].Life-long Learning: Recognize the need for and have the preparation and
ability to engage in independent and life-long learning in the broadest
context of technological change.

[PSO.1] Will be able to design, develop and implement efficient software for a
given real-life problem.
[PSO.2] Will be able to apply knowledge of AI, Machine Learning and Data Mining
in analyzing big data for extracting useful information from it and for
performing predictive analysis.
[PSO.3] Will be able to design, manage and secure wired/ wireless computer
networks for transfer and sharing of information.

E. Assessment Plan:

Criteria Description Maximum Marks

Mid-Term Examination 30
Internal Assessment (Close Book)
(Summative)
Class Work Sessional (CWS): 30
• Tutorial Copy – 5 marks (5 + 5 + 10 + 10)
• Attendance – 5 marks
• 2 Quizzes – 10 marks
• Case-Study – 10 marks

End Term Exam End Term Exam 40

(Summative) (Close Book)
Total 100

F. Syllabus:

Introduction: Basic objectives of cryptography, Secret-key and public-key

cryptography, One-way trapdoor one-way functions, Cryptanalysis, Attack models,
Classical cryptography; Block ciphers: Modes of operation, Public-key parameters:
Modular arithmetic, GCD, primality testing, Chinese remainder theorem, modular
square roots, finite fields; DES and its variants, AES, Linear and differential
cryptanalysis; Message digest: Properties of hash functions, MD2, MD5 and SHA-1,
Keyed hash functions, Attacks on hash functions. Pseudorandom Number
Generation; Intractable problems: Integer factorization problem, RSA problem,
Modular square root problem, Discrete logarithm problem, Diffie-Hellman problem,
 known algorithms for solving the intractable problems; Public-key encryption: RSA,
EIGamal scheme, Elliptic and hyperelliptic, curve cryptography, Side channel attacks,
Diffie-Hellman and MQV key exchange; Digital signatures: RSA, DSA and NR
signature schemes, blind and undeniable signatures; Entity authentication:
Passwords, Challengeresponse algorithms, Zero-knowledge protocols; Transport-
Level Security: Web Security Issues, Secure Sockets Layer (SSL), Transport Layer
Security (TLS), Electronic Mail Security, Pretty Good Privacy (PGP); IP Security: IP
Security Overview, IP Security Policy, Encapsulating Security, Payload, Combining
Security Associations, Internet Key Exchange.

Textbooks
1. B. A. Forouzan, D. Mukhopadhyay, “Cryptography and Network Security”, McGraw
Hill, 3rd Edition, 2008.
2. W. Stallings, “Cryptography and Network Security: Principles and Practice”,
Prentice Hall, 5th edition, 2010.

G. Lecture Plan:

Mode of
Lect. Mode of
Topics Session Outcome CO Assessing
No. delivery CO

Describe the
Introduction to Security objectives of MTE, CWS,
1. 1 Goals, Attacks, Services 1 Lecture
cryptography and its ETE
and Mechanisms types.

Explain two main types

Secret-key and public- MTE, CWS,
2. 2 key cryptography of cryptographic 1 Lecture ETE
techniques

Make use of modular

arithmetic and MTE, CWS,
3. 3 Modular Arithmetic 2 Lecture
extended Euclidian ETE
algorithm

Apply linear
MTE, CWS,
4. 4 Linear Congruence congruence and its 2 Lecture ETE
applications

Demonstrate the
Substitution Ciphers-1 MTE, CWS,
5. 5 working of substitution 1 Lecture ETE
ciphers
 Substitution Ciphers-2 Demonstrate the
MTE, CWS,
6. 6 working of substitution 1 Lecture ETE
ciphers

Demonstrate the MTE, CWS,

7. 7 Transposition Ciphers working of 1 Lecture ETE
transposition ciphers
Learning
Solve problems on
through MTE, CWS,
8. Tutorial Session Substitution and 1
problem- ETE
transposition ciphers
solving
Lecture/
Algebraic Structures Solve problems on MTE, CWS,
9. 1 2 Flipped
1 algebraic structures Classroo ETE
m

10. 1 Finite fields Solve problems on Peer MTE, CWS,

2
8 Finite fields teaching ETE

Solve problems on MTE, CWS,

11. GF(2^n) Fields 2 Lecture
GF(2^n) fields ETE
Learning
Solve problems on
through MTE, CWS,
12. Tutorial Session Finite and GF(2^n) 2
problem- ETE
fields
solving
Understanding
13. 1 Modern Symmetric Key operations of modern 3
MTE, CWS,
Lecture
9 Ciphers : Operations ciphers
ETE

14. 2 Fiestel Structures Demonstration of the MTE, CWS,

3 Lecture
0 Fiestel structures ETE

15. 2 Simplified DES Understanding DES MTE, CWS,

3 Lecture
2 cipher ETE

Learning
Solve problems on
through MTE, CWS,
16. Tutorial Session Finite fields and 3
problem- ETE
Simplified DES
solving

17. 2 DES Understanding DES MTE, CWS,

3 Lecture
3 cipher ETE

Lecture/
18. 2 Variants of DES Understanding Flipped MTE, CWS,
3
4 variants of DES Classroo ETE
m
 Technolo
Block Cipher Modes of Demonstration of MTE, CWS,
19. 3 gy based
Operation modes of operation ETE
learning

20. 2 AES Structure, AES Knowledge of AES

3
MTE, CWS,
Lecture
5 Round Functions cipher ETE

Understanding key
21. 2 AES Key Expansion MTE, CWS,
expansion of AES 3 Lecture
6 ETE
algorithm

Technolo
22. 2 Security issues of DES Illustrating attacks on
3
MTE, CWS,
gy based
7 and AES DES and AES ETE
learning
Learning
through MTE, CWS,
23. Tutorial Session Solve Simplified AES 3
problem- ETE
solving
Utilize number theory MTE, CWS,
24. Number Theory 2 Lecture
and its applications ETE
Solve problems on
25. 2 Euler’s Theorem and Euler’s theorem and
2 Lecture CWS, ETE
8 Fermat’s Little Theorem Fermat’s Little
theorem

Learning
Solve problems on through MTE, CWS,
26. Tutorial Session 2
Number Theory Topics problem- ETE
solving
Make use of
27. Asymmetric key ciphers: asymmetric key MTE, CWS,
4 Lecture
RSA ciphers and RSA ETE
algorithm
Diffie Hellman Make use of Diffie MTE, CWS,
28. 4 Lecture
Cryptosystem Hellman cryptosystem ETE
Make use of Elgamal MTE, CWS,
29. Elgamal cryptosystem 4 Lecture
cryptosystem ETE
Elliptic curve Make use of Elliptic MTE, CWS,
30. 4 Lecture
cryptography-1 Curve cryptography ETE
Elliptic curve Make use of Elliptic MTE, CWS,
31. 4 Lecture
cryptography-2 Curve cryptography ETE
Learning
Make use of
through MTE, CWS,
32. Tutorial Session asymmetric key 4
problem- ETE
ciphers
solving
 MID TERM EXAMINATION

33. 2 Describe MD5 5 CWS, ETE

Lecture
9 Hash functions: MD5

34. 3 Secure Hash Algorithm Describe Secure Hash

5 Lecture CWS, ETE
0 Algorithm

35. 3 Keyed hash functions Explain keyed Hash

5 Lecture CWS, ETE
1 algorithms

36. 3 Attacks on Hash Recall attacks on Hash

5 CWS, ETE
Lecture
2 functions functions

Illustrate Side Channel Technolo

37. 3 Side Channel Attacks 5 CWS, ETE
Attacks gy based
7
learning
Lecture/
38. 4 DSA and NR signature Illustrate Digital Flipped
5 CWS, ETE
0 Signature schemes Classroo
schemes
m

Lecture/
39. 4 Blind and undeniable Illustrate Blind and Flipped
5 CWS, ETE
1 Undeniable Signatures Classroo
signatures
m
Lecture/
40. 4 Passwords, challenge- Know the concept of
5 Flipped CWS, ETE
2 response algorithms CR algorithms Classroo
m
Know the concept of Lecture/
41. 4 Zero-knowledge zero- knowledge 5 Flipped CWS, ETE
3 protocols protocols Classroo
m

42. 4 Web Security Issues Explain various web Peer

5 CWS, ETE
4 security issues teaching

43. 4 Secure Socket Layer Demonstrate the

5 CWS, ETE
Lecture
5 (SSL) concept of SSL

44. 4 Transport Layer Security Demonstrate the

5 CWS, ETE
Lecture
6 (TLS) concept of TLS

Explain the
45. 4 Electronic Mail Security concept of Electronic 5 Peer CWS, ETE
7 Mail Security teaching
46. 4 Pretty Good Privacy Demonstrate the
5 CWS, ETE
Lecture
8 (PGP) concept of PGP

47. 4 IP Security Overview Understanding IP Peer

5 CWS, ETE
9 Security teaching

48. 5 IP Security Policy Understanding IP

5 Lecture CWS, ETE
0 Security Policy

END TERM EXAMINATION

H. Course Articulation Matrix:

CO Statement Correlation with Program Outcomes and Program Specific Outcomes

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

Illustrate the fundamentals of 3 2 1 1 1 1 1 1

1
cryptography

Solve problems using mathematical 3 2 2 1 1 1

2 concepts in cryptographic
techniques
Demonstrate the use of symmetric 3 3 2 1 2 2 2 1 1 1 1 3
3 encryption algorithms such as DES,
AES, and their modes of operation.
Utilize public-key techniques such as 3 3 2 1 2 2 2 1 1 1 1 3
RSA, Diffie-Hellman, and Elliptic
4
Curve Cryptography for secure key
exchange and encryption.
Demonstrate secure communication 3 3 2 1 2 3 2 1 1 3
5
and authentication techniques
1: Low Correlation 2: Moderate Correlation 3: Substantial Correlation