VASIREDDY VENKATADRI INSTITUTE OF

TECHNOLOGY NAMBUR-522508
ANDHRA PRADESH, INDIA
YEAR : III [Link] SEMESTER: II
COURSE NAME: CRYPTOGRAPHY AND NETWORK SECURITY
COURSE CODE: XXXXXXXX
BRANCH: COMMON TO CSE & IT
PREREQUISITE: Computer Networks, MFCS, Data Structures
COURSE OBJECTIVE: To understand and classify various security attacks, services
mechanisms and classical cryptographic techniques and to analyse the design principles of block
ciphers, asymmetric key cryptography and their implementation. And also gives a strong foundation
on Hash Algorithms, Digital Signatures, various Network Security and System Security
mechanisms.
COURSE OUTCOMES: Students will be able to:
Cognitive
Levels as
Weightag
SN OUTCOME per
e (%)
Bloom’s
Taxonomy
Classify various security attacks, services mechanisms
CO1 L1, L2, L3,L4 20
and classical cryptographic techniques
Analyse the design principles of block ciphers and their L1, L2,
CO2 20
implementation. L3,L4
Computes and Analyse various Asymmetric Key L1, L2,
CO3 20
Cryptographic techniques L3, L4
Evaluates Authentication, Hash Codes and verify the
CO4 L1,L2,L3 20
digital signatures
CO5 Impart the knowledge on Network security concepts L1,L2,L3 20

WEIGHTAGE OF BLOOM’S LEGENDS & PERCENTAGE OF QUESTIONS IN

EXAMINATIONS:
L1 (Remembering) = 30 - 40%, L2 (Understanding) = 30 -
40%,
L3 (Applying) = 15 - 25 %, L4 (Analysing) = 5-10%,
Easy (%) = 15%-20%, Average (%) = 60% - 70%, Difficult (%) = 15% - 20%
TOTAL = L1 + L2 + L3 + L4 = 100% (on an average about 2 minutes per mark)
Note: This specification weightage in above shall be treated as a general
guideline for students, teachers and paper setters. The actual distribution of
marks in the question paper may vary slightly.
DETAILED SYLLABUS:

UNIT-I: Introduction to Cryptography and Network Security 12 Hrs

Introduction: Security attacks, services & mechanisms, Network Security Model, Symmetric Cipher
Model, Mathematics of Cryptography, Substitution Ciphers, Transposition Ciphers Techniques,
Steganography.
UNIT-II: Symmetric Key Cryptography 12 Hrs
Mathematics of Symmetric Key Cryptography, Modern Block Ciphers, Modes of Block Ciphers,
Design Principles of Block Ciphers, Feistel Cipher, Data Encryption Standard, Double DES, Triple
DES, International Data Encryption Algorithm, CAST-128, Blowfish, Advanced Encryption
Standard
UNIT–III: Asymmetric (Public) Key Cryptography 10 Hrs
Mathematics of Asymmetric Key Cryptography: Prime Numbers, Modular Arithmetic, Fermat’s and
Euler’s Theorem, Chinese Remainder Theorem, Primitive Roots, Discrete Logarithms, Principles of
Public Key Cryptosystems, Applications, RSA, Key Management, Diffie-Hellman Key Exchange,
Elliptic Curve Cryptography, El-Gammal Key Exchange.
UNIT-IV: Data Integrity, Digital Signatures, Authentication Protocols 10 Hrs
Requirements of Hash Functions and Message Authentication Codes, Hash Algorithms: MD5, SHA-
160,256,512, RIPEMD, Properties of Digital Signatures, DSS, Authentication Applications:
Kerberos Version4 and Version 5.
UNIT – V: Network Security 14 Hrs
IP Security: IP Security Overview, Architecture, Authentication Header, Encapsulating Security
Payload,
Web Security: Overview, Secure Socket Layer and Transport Layer Security, Secure Electronic
Transaction,
Email Security: Pretty Good Privacy, S/MIME,
System Security: Intruders, Password Management, Viruses and Worms.

Text Books:
1. Cryptography and Network Security Principles and Practices: William Stallings, Pearson
Education, 5th Edition
2. Cryptography and Network Security, Behrouz A Forouzan, Tata McGraw Hill, 3rd Edition

Reference Book:
1. Practical Cryptography, Bruce Schneier, Wiley, Deamtech India Pvt Ltd.

Web Resources:
1. [Link]
2. [Link]
MICRO-SYLLABUS:

Unit Module Micro content No of hrs

What is security?
Introduction Security Mechanisms and 2
Services
Types of Attacks, Network
Security Attacks 2
Security Model
Integer Arithmetic, Modular
Arithmetic Operations, Finding
Mathematics of
GCD using Euclidian Algorithm, 3
Cryptography
Extended Euclidian Algorithm,
1 Linear Diophantine Equations
Introduction to
security Caeser, Brute force Cryptanalysis,
Additive, Product, Affine,
Substitution
Playfair, Hill, Polyalphabetic 3
Ciphers
ciphers: Vigenère, Vernam,
OneTimePad

Railfence, Columnar
Transposition
Transposition, Row
Ciphers 2
Transposition, Rotor Machines
Steganography Types of Steganography

Unit Module Micro content No of hrs

Algebraic structures: Groups,
Permutation Groups, Finite group,
Mathematics of Order of a group, Subgroup,
Symmetric Key Cyclic Subgroup, Legranges
6
Cryptography Theorem, Order of an Element,
2
Rings, Fields, Finite Fields,
Symmetric Key
Galois Fields, Arithmetic
Cryptography n
operations on GF(2 )
Design Principles, Modes of
Block Ciphers 2
Block Ciphers
Modern
DES, Double DES, Triple DES,
Cryptographic 4
IDEA, CAST 128, Blowfish, AES
Algorithms,

Unit Module Micro content No of hrs

Number Theory, Prime
Mathematics of Numbers, Fermats , Euler’s,
Asymmetric Key Chines Remainder Theorems, 5
3 Cryptography Primitive Roots, Discrete
Asymmetric Key Logarithms
Cryptography Introduction, RSA, Security
Public key of RSA, Diffie-Hellman,
5
Cryptography Elliptic Curve Cryptography,
El-Gammal Encryption

Unit Module Micro content No of hrs

4 Data Integrity Requirements of Message 5
Data Integrity, Authentication Codes,
 Requirements of Hash
Functions, Hash
Algorithms: MD5, SHA
Digital Signatures, 160, 256, 512, RIPEMD
Authentication Introduction, Properties,
Protocols Digital Signatures Types, Digital Signature 3
Algorithm
Authentication Introduction, Kerberos
2
Protocols Version 4 and 5
Unit Module Micro content No of hrs
Overview, Architecture,
Authentication Header,
IP Security 4
Encapsulating Security
Payload Header
Overview, Secure Socket
Layer, Transport Layer
5 Web Security 4
Security, Secure
Network Security
Electronic Transaction
Introduction, PGP,
Email Security 3
S/MIME
Intruders, Password
System Security Management, Viruses and 3
Worms

*****
Code No : R20

III B. TECH II SEMESTER REGULAR EXAMINATION MODEL PAPER

CRYPTOGRAPHY AND NETWORK SECURITY
(COMMON TO CSE & IT BRANCHES)
Time : 3 Hours Max. Marks :
70
___________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________

Note : Answer ONE question from each unit (5 × 14 = 70 Marks)

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
~~~~~~~~~
UNIT-I CO BL
1. a What is a Network Security Model and its various [7M CO1 L1
) components? ]
b Explain Security Services and Security Mechanisms [7M CO1 L2
) ]
(OR)
2. a Encrypt the message “The key is hidden under the door pad” with [7M CO1 L3
) “GUIDANCE” as key word using Playfair Cipher. ]
b Explain in detail Euclidian Algorithm and its [7M CO1 L2
) applications in Cryptography ]
UNIT-II
3. a Describe the Design Principles of DES [7M CO2 L2
) ]
b Describe the working methodology of Blowfish [7M CO2 L2
) Algorithm ]
(OR)
4. a Solve the Multiplicative inverse of x5 modulo x 8 + x4 + [7M CO2 L3
) x3 + x+1 in the GF(28) ]
b Simplify result of (x5 + x2 + x) ⊗ (x7 + x4 + x3 + x2 + x) in GF(28) with [7M CO2 L4
) irreducible polynomial (x8 + x4 + x3 + x + 1). ]
UNIT-III
5. a Illustrate El-Gammal Encyrption Algorithm [7M CO3 L2
) ]
b Describe the various [7M CO3 L3
) ]
(OR)
6. a Idenfity an integer x that has a remainder of 3, when divided by 7 [7M CO3 L3
) and 13, but is divisible by 12 using Chinese Remainder Theorem ]
b Define a) Euler’s Totient Function [7M CO3 L1
) b) Fermat’s Theorem ]
c) Euler’s Theorem
UNIT-IV
7. a Infer the Handshakes involved in Kerberos Version 4 [7M CO4 L3
) Protocol ]
b What are the requirements of Hash functions and [7M CO4 L1
) Message Authentication Codes ]
 (OR)
8. a Write the working Principle of HMAC and CMAC [7M CO4 L1
) algorithm. ]
b Explain the different types of Digital Signatures [7M CO4 L2
) ]
UNIT-V
9. a Outline the IP Security Architecture and its protocols [7M CO5 L1
) ]
b Describe the various functions involved in [7M CO5 L2
) implementing the Pretty Good Privacy Protocol ]
(OR)
10 a Describe the Architecture of Secure Socket Layer [7M CO5 L2
. ) ]
b Write short notes on Password management [7M CO5 L1
) techniques ]

*****
THE ABOVE MODEL PAPER ATTAINMENTS OF BLOOM’S TEXONOMY IS
AS FOLLOWS

L1: 6*7 = 42 = 30%

L2: 8*7 = 56 = 40%
L3: 5*7 = 35 = 25%
L4: 1*7 = 07 = 05%

SIGNATURES OF

COURSE COORDINATER MODULE COORDINATER HOD