L T P C

CRYPTOGRAPHY AND CRYPTANALYSIS 3 0 0 3

COURSE OBJECTIVES

 To study about the fundamentals of Cryptography

 To analyze Key Management techniques and importance of number Theory
 To understand the concept of Message Authentication Codes and Hash Functions
 To design a security solution for a given application
 To understand about cyber crimes and the different security practice.

PREREQUISITE:
 Fundamentals of Mathematics

UNIT-I INTRODUCTION TO CRYPTOGRAPHY 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-II ASYMMETRIC CRYPTOGRAPHY 9

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-III MESSAGE AUTHENTICATION AND HASH FUNCTION 9

Authentication Requirements - Authentication Function - Message Authentication Codes - Hash
Functions - Security of Hash Functions and MACs - Secure Hash Algorithm - Whirlpool,
HMAC, CMAC - Digital Signatures - Authentication Protocol - Digital Signature Standard
- Authentication Applications- Kerberos - X.509 Authentication Service - Public-key
infrastructure.

UNIT-IV FIREWALLS AND CRYPTANALYSIS 9

Intruder – Intrusion Detection System - Password Management - Virus and Related Threats
- Countermeasures - Firewall Design Principles- Trusted Systems -Practical Implementation of
Cryptography and Security.
UNIT-V CYBER CRIMES AND 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:

At the end of the course, the student should be able to:

 Understand the fundamentals of networks security.

 Demonstrate the different cryptographic operations of symmetric cryptographic
algorithms.
 Develop the different cryptographic operations of public key cryptography.
 Explain the various Authentication schemes to simulate different applications.
 Understand various cyber-crimes and cyber security.

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

REFERENCES:
1. Behrouz A. Forouzan, DebdeepMukhopadhyay, "Cryptography and Network Security",
3rd Edition, Tata McGraw Hill, 2015.
2. Charles Pfleeger, Shari Pfleeger, Jonathan Margulies, "Security in Computing", Fifth
Edition, Prentice Hall, New Delhi, 2015.

WEB REFERENCES:
 https://www.w3.org/TR/WebCryptoAPI/
 https://ukdiss.com/examples/web-based-crypto-analysis-learning-application.php
 https://developer.mozilla.org/en-US/docs/Web/API/Web_Crypto_API
 https://www.garykessler.net/library/crypto.html
 https://www.cryptomathic.com/news-events/blog/summary-of-cryptographic-algorithms-according-to-nist
CO-PO MAPPINGS:

CO\PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 2 2 1 - - - - - - 2 2
CO2 1 2 2 1 2 - - - - - 2 2
CO3 2 2 2 2 - - - - - - - 2
CO4 2 2 1 2 - - 1 - - 1 2 1
CO5 3 1 2 2 2 - - - - 1 2 2