Scribd
Upload
21 views

Cns

Uploaded by

dharanivijayakumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Cns

Uploaded by

dharanivijayakumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s


1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 3 3 1 3 2 3 2
2 3 3 3 3 3 - - - 3 2 3 2 2 1 2
3 3 3 2 2 3 - - - 3 1 1 1 2 2 3
4 3 2 2 1 1 - - - 2 3 2 3 1 2 1
5 3 3 3 2 1 - - - 2 1 1 3 2 1 2
AVg. 3.00 2.80 2.60 2.20 2.00 - - - 2.60 2.00 1.60 2.40 1.80 1.80 2.00
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CB3491 CRYPTOGRAPHY AND CYBER SECURITY L T P C


3 0 0 3
COURSE OBJECTIVES:
 Learn to analyze the security of in-built cryptosystems.
 Know the fundamental mathematical concepts related to security.
 Develop cryptographic algorithms for information security.
 Comprehend the various types of data integrity and authentication schemes
 Understand cyber crimes and cyber security.

UNIT I INTRODUCTION TO SECURITY 9


Computer Security Concepts – The OSI Security Architecture – Security Attacks – Security Services
and Mechanisms – A Model for Network Security – Classical encryption techniques: Substitution
techniques, Transposition techniques, Steganography – Foundations of modern cryptography:
Perfect security – Information Theory – Product Cryptosystem – Cryptanalysis.

UNIT II SYMMETRIC CIPHERS 9


Number theory – Algebraic Structures – Modular Arithmetic - Euclid‘s algorithm – Congruence and
matrices – Group, Rings, Fields, Finite Fields

SYMMETRIC KEY CIPHERS: SDES – Block Ciphers – DES, Strength of DES – Differential and
linear cryptanalysis – Block cipher design principles – Block cipher mode of operation – Evaluation
criteria for AES – Pseudorandom Number Generators – RC4 – Key distribution.

UNIT III ASYMMETRIC CRYPTOGRAPHY 9


MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes – Primality Testing –
Factorization – Euler’s totient function, Fermat’s and Euler’s Theorem – Chinese Remainder
Theorem – Exponentiation and logarithm

ASYMMETRIC KEY CIPHERS: RSA cryptosystem – Key distribution – Key management – Diffie
Hellman key exchange -– Elliptic curve arithmetic – Elliptic curve cryptography.

UNIT IV INTEGRITY AND AUTHENTICATION ALGORITHMS 9


Authentication requirement – Authentication function – MAC – Hash function – Security of hash
function: HMAC, CMAC – SHA – Digital signature and authentication protocols – DSS – Schnorr
Digital Signature Scheme – ElGamal cryptosystem – Entity Authentication: Biometrics, Passwords,
Challenge Response protocols – Authentication applications – Kerberos
MUTUAL TRUST: Key management and distribution – Symmetric key distribution using symmetric
and asymmetric encryption – Distribution of public keys – X.509 Certificates.
97
UNIT V CYBER CRIMES AND CYBER SECURITY 9
Cyber Crime and Information Security – classifications of Cyber Crimes – Tools and Methods –
Password Cracking, Keyloggers, Spywares, SQL Injection – Network Access Control – Cloud
Security – Web Security – Wireless Security

TOTAL:45 PERIODS

COURSE OUTCOMES:
CO1: Understand the fundamentals of networks security, security architecture, threats and
vulnerabilities
CO2: Apply the different cryptographic operations of symmetric cryptographic algorithms
CO3: Apply the different cryptographic operations of public key cryptography
CO4: Apply the various Authentication schemes to simulate different applications.
CO5: Understand various cyber crimes and cyber security.

TEXT BOOKS
1. William Stallings, "Cryptography and Network Security - Principles and Practice", Seventh
Edition, Pearson Education, 2017.
2. Nina Godbole, Sunit Belapure, “Cyber Security: Understanding Cyber crimes, Computer
Forensics and Legal Perspectives”, First Edition, Wiley India, 2011.

REFERENCES
1. Behrouz A. Ferouzan, Debdeep Mukhopadhyay, "Cryptography and Network Security", 3rd
Edition, Tata Mc Graw Hill, 2015.
2. Charles Pfleeger, Shari Pfleeger, Jonathan Margulies, "Security in Computing", Fifth Edition,
Prentice Hall, New Delhi, 2015.

CO’s-PO’s & PSO’s MAPPING


CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 2 2 - - - 1 - - 1 2 3 3
2 3 3 3 3 3 - - - 2 - - 1 3 3 3
3 3 3 3 3 3 - - - 2 - - 1 3 3 3
4 3 3 3 3 3 - - - 2 - - 1 3 3 3
5 3 2 3 2 3 - - - 3 - - 2 3 2 3
AVg. 3 2.6 2.6 2.6 2.8 - - - 2 - - 1.2 2.8 2.8 3
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3551 DISTRIBUTED COMPUTING L T P C


3 0 0 3
COURSE OBJECTIVES:
 To introduce the computation and communication models of distributed systems
 To illustrate the issues of synchronization and collection of information in distributed systems
 To describe distributed mutual exclusion and distributed deadlock detection techniques
 To elucidate agreement protocols and fault tolerance mechanisms in distributed systems
 To explain the cloud computing models and the underlying concepts

98

You might also like