CY5001 - Information Security

Uka Tarsadia University
B.Tech.
Semester V
INFORMATION SECURITY
CY5001
EFFECTIVE FROM July-2022

Syllabus version: 1.00
Teaching Scheme (Hours)
Subject
Subject Title Credits
Code Theory Practical
Theory Practical
CY5001 Information Security 3 2 3 1
Theory Practical
Examination Examination
Marks Marks
Subject Total
Subject Title
Code Marks
Internal External CIE
CY5001 Information Security 40 60 50 150
Objective of the course:

• To explain fundamental mathematics behind security, security requirement and
management of cryptographic properties.
• To illustrate the principles and design of cryptographic algorithms and protocols.
Course Outcomes:
Upon completion of the course, the student shall be able to
CO1: Distinguish between the three major goals of information security: confidentiality,
integrity and authentication and able to identify type of security attacks.
CO2: Solve and analyze classical encryption techniques used.
CO3: Evaluate and illustrate various symmetric key concepts used as security
mechanisms.
CO4: Solve and apply relavant mathematical theorem while integrating security
mechanisms.
CO5: Evaluate and illustrate various public key cryptographic concepts along with key
distribution techniques.
CO6: Discuss and assess various solutions to provide authentication, integrity,
confidentiality and digital signatures.
Sr. No. Topic Hours

Unit – I
1 Fundamentals of cryptography: 5
The OSI security architecture, Security attacks, Security services,
Security mechanisms, A model for network security.
Unit – II
2 Classical encryption techniques: 8
Symmetric cipher model, Substitution techniques, Transposition
techniques, Steganography.
Unit – III
3 Block ciphers: 10
Traditional block ciphers (SPN) – Feistel, Simplified Data
Encryption Standard (DES), Block cipher design principles, Data
Encryption Standard (DES), Multiple encryption and triple DES,
Block cipher modes of operation, Advanced Encryption Standard
(AES).
Unit – IV
4 Number theory: 5
Random number generation, Prime and relative prime numbers,
Modular arithmetic, Euler’s theorem, Euclid’s algorithm, Overview
of group, Ring, Fields, Finite fields of the form GF(p), Polynomial
arithmetic, Finite fields of the form GF(2n).
Unit – V
5 Public key cryptography: 8
Principles of public key cryptosystems, RSA algorithm, Security of
RSA, Key management, Diffie-Hellman key exchange, The El-Gamal
cryptosystem and its security.
Unit – VI
6 Message authentication, Hash function and Digital Signature: 9
Introduction of hash functions, Applications of hash functions,
Requirements and security, Secure Hash Algorithm (SHA), Message
digest algorithm (MD5), Message Authentication Codes (MAC)
requirements and functions, MACs based on hash functions –
HMAC, Digital signatures requirements, Digital signature
standards, Digital Signature Algorithm (DSA).
Sr.
Information Security (Practical) Hours
No.
1 Implementation of caesar cipher and brute force attack. 4
2 Implementation of playfair cipher. 4
3 Implementation of polyalphabetic cipher. 2
4 Implementation of rail fence technique. 2
5 Implementation of columnar technique. 4
6 Implementation of RSA algorithm. 4
7 Implementation of Diffie Hellman key exchange algorithm. 2
8 Implementation of key generation for simplified DES. 4
9 Case study of crypt analytics tool. 4
Text books:
1. William Stallings - “Cryptography and Network Security” - 6th Edition, Pearson
publication.
Reference book:
1. Behrouz Forouzan, Debdeep Mukhopadhyay – “Cryptography and Network
Security”, McGraw Hill education.
2. Dhiren Patel – “Information Security: Theory and Practice”, PHI publication.
3. Atul Kahate – “Cryptography and Network Security”, McGraw Hill education.
4. Bernard Menezes – “Network Security and Cryptography” – Cengage learning.
5. Bruce Schneier – “Applied Cryptography: Protocols, Algorithms and Source Code
in C”, John Wiley & Sons.
Course objectives and Course outcomes mapping:

• To explain fundamental mathematics behind security, security requirement and
management of cryptographic properties: CO1, CO2, CO4
• To illustrate the principles and design of cryptographic algorithms and protocols:
CO3, CO4, CO6
Course units and Course outcome mapping:
Unit Unit Name Course Outcomes

No.
CO1 CO2 CO3 CO4 CO5 CO6
1 Fundamentals of cryptography √
2 Classical encryption techniques √
3 Block ciphers √
4 Number theory √
5 Public key cryptography √
Message authentication, Hash √

6
function and Digital Signature
Programme Outcomes:
PO 1: Engineering knowledge: An ability to apply knowledge of mathematics,

science, and engineering.
PO 2: Problem analysis: An ability to identify, formulates, and solves engineering
problems.
PO 3: Design/development of solutions: An ability to design a system, component,
or process to meet desired needs within realistic constraints.
PO 4: Conduct investigations of complex problems: An ability to use the
techniques, skills, and modern engineering tools necessary for solving
engineering problems.
PO 5: Modern tool usage: The broad education and understanding of new
engineering techniques necessary to solve engineering problems.
PO 6: The engineer and society: Achieve professional success with an
understanding and appreciation of ethical behaviour, social responsibility, and
diversity, both as individuals and in team environments.
PO 7: Environment and sustainability: Articulate a comprehensive world view that
integrates diverse approaches to sustainability.
PO 8: Ethics: Identify and demonstrate knowledge of ethical values in non-classroom
activities, such as service learning, internships, and field work.
PO 9: Individual and team work: An ability to 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/receive clear instructions.
PO 11: Project management and finance: An ability to 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: A recognition of the need for, and an ability to engage in
life-long learning.
Programme Outcomes and Course Outcomes mapping:
Programme
Course Outcomes
Outcomes
CO1 CO2 CO3 CO4 CO5 CO6
PO1 ✓ ✓ ✓ ✓
PO2 ✓ ✓ ✓ ✓ ✓ ✓
PO3 ✓ ✓ ✓ ✓ ✓ ✓
PO4 ✓ ✓ ✓
PO5 ✓ ✓ ✓
PO6
PO7
PO8
PO9
PO10
PO11
PO12

CY5001 - Information Security

Uploaded by

Copyright:

Available Formats

CY5001 - Information Security

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CY5001 - Information Security

Uploaded by

Copyright:

Available Formats

Uka Tarsadia University

EFFECTIVE FROM July-2022

CY5001 Information Security 40 60 50 150

Objective of the course:

Sr. No. Topic Hours

2 Implementation of playfair cipher. 4

3 Implementation of polyalphabetic cipher. 2

4 Implementation of rail fence technique. 2

5 Implementation of columnar technique. 4

6 Implementation of RSA algorithm. 4

7 Implementation of Diffie Hellman key exchange algorithm. 2

8 Implementation of key generation for simplified DES. 4

9 Case study of crypt analytics tool. 4

Course objectives and Course outcomes mapping:

Course units and Course outcome mapping:

Unit Unit Name Course Outcomes

2 Classical encryption techniques √

5 Public key cryptography √

Message authentication, Hash √

PO 1: Engineering knowledge: An ability to apply knowledge of mathematics,

Programme Outcomes and Course Outcomes mapping:

You might also like