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
Course Instructor(s): Sinha, Dr. Ankur Pandey, Dr. Juhi
Singh, Dr. Pallavi
Additional Practitioner(s) – if any
(Industry Fellow/ Visiting Faculty/ To be identified and appointed later
Adjunct 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
C
CO Statement Level Attainm Attainm
O
ent % ent level
2
Illustrate the fundamentals of 1 (Understan ≥ 80 3
cryptography
d)
Solve problems on 3 ≥ 70% <
mathematical concepts used in 2 2
(Apply) 80%
cryptographic techniques
Make use of symmetric
encryption algorithms such as 3 ≥ 70% <
DES and AES, along with their 3 2
(Apply) 80%
modes of operation, in a
defined context.
Utilize public-key techniques
such as RSA, Diffie-Hellman, 3
and Elliptic Curve 4 ≥ 80 3
(Apply)
Cryptography for secure key
exchange and encryption
Demonstrate secure 2
communication and 5 (Understan ≥ 80 3
authentication techniques d)

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 (Close Book)
Assessment
Class Work Sessional 30
(Summative)
(CWS):
(5 + 5 + 10 + 10)
 Tutorial Copy – 5
marks
 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, Challenge
response 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 Mode of
Lect. of
Topics Session Outcome CO Assessin
No. deliver g CO
y
Introduction to
Security Goals, Describe the
1. objectives of MTE,
1 Attacks, Services 1
and Mechanisms cryptography and Lecture CWS, ETE
its types.

Explain two main

Secret-key and
2. types of MTE,
public-key 1 Lecture
2 cryptographic CWS, ETE
cryptography
techniques
 Make use of
3. modular arithmetic MTE,
Modular Arithmetic 2 Lecture
3 and extended CWS, ETE
Euclidian algorithm

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

Substitution Ciphers- Demonstrate the 1

5. MTE,
1 working of Lecture
5 CWS, ETE
substitution ciphers

Substitution Ciphers- Demonstrate the

6. 2 MTE,
working of 1 Lecture
6 CWS, ETE
substitution ciphers

Demonstrate the
7. working of MTE,
1 Lecture
7 Transposition Ciphers transposition CWS, ETE
ciphers
Learnin
Solve problems on
g
Substitution and MTE,
8. Tutorial Session 1 through
transposition CWS, ETE
problem
ciphers
-solving

Algebraic Structures Solve problems on Lecture/

9. MTE,
algebraic 2 Flipped
1 CWS, ETE
structures Classro
om
10. Solve problems on Peer MTE,
1 Finite fields Finite fields
2 teachin CWS, ETE
g
Solve problems on MTE,
11. GF(2^n) Fields 2 Lecture
GF(2^n) fields CWS, ETE
Learnin
Solve problems on g
MTE,
12. Tutorial Session Finite and GF(2^n) 2 through
CWS, ETE
fields problem
-solving

13. Modern Symmetric Understanding 3

MTE,
1 Key Ciphers : operations of Lecture CWS, ETE
Operations modern ciphers

14. Fiestel Structures Demonstration of 3

MTE,
2 the Fiestel Lecture CWS, ETE
structures
15. Understanding DES MTE,
2 Simplified DES cipher
3 Lecture CWS, ETE

Solve problems on Learnin

Finite fields and g
MTE,
16. Tutorial Session Simplified DES 3 through
CWS, ETE
problem
-solving
17. Understanding DES Lecture MTE,
2 DES cipher
3
CWS, ETE

Lecture/
18. Understanding MTE,
Flipped
2 Variants of DES variants of DES
3
CWS, ETE
Classro
om
Block Cipher Modes Demonstration of Technol MTE,
of Operation modes of operation ogy CWS, ETE
19. 3
based
learning
20. AES Structure, AES Knowledge of AES Lecture MTE,
2 Round Functions 3
cipher CWS, ETE

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

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

Solve problems on Learnin

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

34. Secure Hash Describe Secure Lecture

3 Algorithm 5 CWS, ETE
Hash Algorithm

35. Keyed hash Explain keyed Hash Lecture

3 functions 5 CWS, ETE
algorithms

36. Attacks on Hash Recall attacks on Lecture

3 functions 5 CWS, ETE
Hash functions

Technol
37. Side Channel Illustrate Side
5 ogy CWS, ETE
3 Attacks Channel Attacks based
learning
Lecture/
38. Illustrate Digital
5 Flipped CWS, ETE
4 DSA and NR Signature schemes
signature schemes Classro
om

Illustrate Blind and Lecture/

39.
Undeniable 5 Flipped CWS, ETE
4 Blind and undeniable
signatures Signatures Classro
om
 Lecture/
40. Passwords, Know the concept Flipped
4 challenge-response of CR algorithms
5 CWS, ETE
algorithms Classro
om
Know the concept Lecture/
41. Zero-knowledge
of zero- knowledge 5 Flipped CWS, ETE
4 protocols
protocols Classro
om
42. Explain various Peer
4 Web Security Issues web security issues
5 teachin CWS, ETE
g
43. Secure Socket Layer Demonstrate the Lecture
4 (SSL) 5 CWS, ETE
concept of SSL

44. Transport Layer Demonstrate the Lecture

4 Security (TLS) 5 CWS, ETE
concept of TLS

Explain the
45. Electronic Mail concept of Peer
4 Security 5 teachin CWS, ETE
Electronic Mail
Security g

46. Pretty Good Privacy Demonstrate the Lecture

4 (PGP) 5 CWS, ETE
concept of PGP

47. Understanding IP Peer

4 IP Security Overview Security
5 teachin CWS, ETE
g
48. Understanding IP Lecture
5 IP Security Policy Security Policy
5 CWS, ETE

END TERM EXAMINATION

H. Course Articulation Matrix:

Correlation with Program Outcomes and Program Specific

CO Statement
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

1 3 2 1 1 1 1
cryptography

Solve problems on
2 mathematical concepts used in 3 2 2 1
cryptographic techniques
Make use of symmetric
encryption algorithms such as
3 DES and AES, along with their 3 3 2 1 3 2 1 1 1 3
modes of operation, in a
defined context.
Utilize public-key techniques
such as RSA, Diffie-Hellman,
4 and Elliptic Curve Cryptography 3 3 2 1 3 2 1 1 1 3
for secure key exchange and
encryption
Demonstrate secure
5 communication and 1 3 2 1 3 3 2 2 2 1 1 3
authentication techniques
1: Low Correlation 2: Moderate Correlation 3: Substantial Correlation