COMPUTER SCIENCE ENGINEERING SEMESTER 7 SYLLABUS

COMPUTER SCIENCE ENGINEERING SEMESTER 7 SYLLABUS

SUBJECTS

CS6701 Cryptography and Network Security
CS6702 Graph Theory and Applications
CS6703 Grid and Cloud Computing
CS6704 Resource Management Techniques
Elective II
Elective III
CS6711 Security Laboratory
CS6712 Grid and Cloud Computing Laboratory

---

---

CS6701 Cryptography and Network Security

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Understand OSI security architecture and classical encryption techniques.
Acquire fundamental knowledge on the concepts of finite fields and number theory.
Understand various block cipher and stream cipher models.
Describe the principles of public key cryptosystems, hash functions and digital signature.

---

UNIT I INTRODUCTION & NUMBER THEORY
Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption techniques (Symmetric cipher model, substitution techniques, transposition techniques, steganography).FINITE FIELDS AND NUMBER THEORY: Groups, Rings, Fields-Modular arithmetic- Euclid’s algorithm-Finite fields- Polynomial Arithmetic –Prime numbers-Fermat’s and Euler’s theorem- Testing for primality -The Chinese remainder theorem- Discrete logarithms.

---

UNIT II BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY
Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption Standard (AES)-Triple DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key management - Diffie Hellman Key exchange- Elliptic curve arithmetic-Elliptic curve cryptography.

---

UNIT III HASH FUNCTIONS AND DIGITAL SIGNATURES
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 - SHA - HMAC – CMAC - Digital signature and authentication protocols – DSS – EI Gamal – Schnorr.

---

UNIT IV SECURITY PRACTICE & SYSTEM SECURITY
Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted System: Roles of Firewalls – Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions. Intruder – Intrusion detection system – Virus and related threats – Countermeasures – Firewalls design principles – Trusted systems – Practical implementation of cryptography and security.

---

UNIT V E-MAIL, IP & WEB SECURITY
E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys privacy-authentication of the source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME. IPSecurity: Overview of IPSec - IP and IPv6-Authentication Header-Encapsulation Security Payload (ESP)-Internet Key Exchange (Phases of IKE, ISAKMP/IKE Encoding). Web Security: SSL/TLS Basic Protocol-computing the keys- client authentication-PKI as deployed by SSLAttacks fixed in v3- Exportability-Encoding-Secure Electronic Transaction (SET).
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security, 6th Edition, Pearson Education, March 2013. (

---

UNIT I,II,III,IV).
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security”, Prentice Hall of India, 2002. (

---

UNIT V).
REFERENCES:
1. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill, 2007.
2. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and Protocols”, Wiley Publications, 2003.
3. Charles Pfleeger, “Security in Computing”, 4th Edition, Prentice Hall of India, 2006.
4. Ulysess Black, “Internet Security Protocols”, Pearson Education Asia, 2000.
5. Charlie Kaufman and Radia Perlman, Mike Speciner, “Network Security, Second Edition, Private Communication in Public World”, PHI 2002.
6. Bruce Schneier and Neils Ferguson, “Practical Cryptography”, First Edition, Wiley Dreamtech India Pvt Ltd, 2003.
7. Douglas R Simson “Cryptography – Theory and practice”, First Edition, CRC Press, 1995. 8. http://nptel.ac.in/.
SUBJECTS

---

---

CS6702 Graph Theory and Applications

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Be familiar with the most fundamental Graph Theory topics and results.
Be exposed to the techniques of proofs and analysis.

---

UNIT I INTRODUCTION
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of trees – Distance and centers in tree – Rooted and binary trees.

---

UNIT II TREES, CONNECTIVITY & PLANARITY
Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and geometric graphs – Planer graphs – Different representation of a planer graph.

---

UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four color problem – Directed graphs – Types of directed graphs – Digraphs and binary relations – Directed paths and connectedness – Euler graphs.

---

UNIT IV PERMUTATIONS & COMBINATIONS
Fundamental principles of counting - Permutations and combinations - Binomial theorem - combinations with repetition - Combinatorial numbers - Principle of inclusion and exclusion - Derangements - Arrangements with forbidden positions.

---

UNIT V GENERATING FUNCTIONS
Generating functions - Partitions of integers - Exponential generating function – Summation operator - Recurrence relations - First order and second order – Non-homogeneous recurrence relations - Method of generating functions.
TEXT BOOKS:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley, 1994.
REFERENCES:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and Mathematicians” , Prentice Hall of India, 1996.
3. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.
SUBJECTS

---

---

CS6703 Grid and Cloud Computing

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Understand how Grid computing helps in solving large scale scientific problems.
Gain knowledge on the concept of virtualization that is fundamental to cloud computing.
Learn how to program the grid and the cloud.
Understand the security issues in the grid and the cloud environment.

---

UNIT I INTRODUCTION
Evolution of Distributed computing: Scalable computing over the Internet – Technologies for network based systems – clusters of cooperative computers - Grid computing Infrastructures – cloud computing - service oriented architecture – Introduction to Grid Architecture and standards – Elements of Grid – Overview of Grid Architecture.

---

UNIT II GRID SERVICES
Introduction to Open Grid Services Architecture (OGSA) – Motivation – Functionality Requirements – Practical & Detailed view of OGSA/OGSI – Data intensive grid service models – OGSA services.

---

UNIT III VIRTUALIZATION
Cloud deployment models: public, private, hybrid, community – Categories of cloud computing: Everything as a service: Infrastructure, platform, software - Pros and Cons of cloud computing – Implementation levels of virtualization – virtualization structure – virtualization of CPU, Memory and I/O devices – virtual clusters and Resource Management – Virtualization for data center automation.

---

UNIT IV PROGRAMMING MODEL
Open source grid middleware packages – Globus Toolkit (GT4) Architecture , Configuration – Usage of Globus – Main components and Programming model - Introduction to Hadoop Framework - Mapreduce, Input splitting, map and reduce functions, specifying input and output parameters, configuring and running a job – Design of Hadoop file system, HDFS concepts, command line java interface, dataflow of File read & File write.

---

UNIT V SECURITY Trust models for Grid security environment – Authentication and Authorization methods – Grid security infrastructure – Cloud Infrastructure security: network, host and application level – aspects of data security, provider data and its security, Identity and access management architecture, IAM practices in the cloud, SaaS, PaaS, IaaS availability in the cloud, Key privacy issues in the cloud.
TEXT BOOK:
1. Kai Hwang, Geoffery C. Fox and Jack J. Dongarra, “Distributed and Cloud Computing: Clusters, Grids, Clouds and the Future of Internet”, First Edition, Morgan Kaufman Publisher, an Imprint of Elsevier, 2012.
REFERENCES:
1. Jason Venner, “Pro Hadoop- Build Scalable, Distributed Applications in the Cloud”, A Press, 2009
2. Tom White, “Hadoop The Definitive Guide”, First Edition. O’Reilly, 2009.
3. Bart Jacob (Editor), “Introduction to Grid Computing”, IBM Red Books, Vervante, 2005
4. Ian Foster, Carl Kesselman, “The Grid: Blueprint for a New Computing Infrastructure”, 2nd Edition, Morgan Kaufmann.
5. Frederic Magoules and Jie Pan, “Introduction to Grid Computing” CRC Press, 2009.
6. Daniel Minoli, “A Networking Approach to Grid Computing”, John Wiley Publication, 2005.
7. Barry Wilkinson, “Grid Computing: Techniques and Applications”, Chapman and Hall, CRC, Taylor and Francis Group, 2010.
SUBJECTS

---

---

CS6704 Resource Management Techniques

L T P C
3 0 0 3
OBJECTIVES:
The student should be made to:
Be familiar with resource management techniques.
Learn to solve problems in linear programming and Integer programming.
Be exposed to CPM and PERT.

---

UNIT I LINEAR PROGRAMMING
Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.

---

UNIT II DUALITY AND NETWORKS
Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality analysis – Transportation and assignment model - Shortest route problem.

---

UNIT III INTEGER PROGRAMMING
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.

---

UNIT IV CLASSICAL OPTIMISATION THEORY:
Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.

---

UNIT V OBJECT SCHEDULING:
Network diagram representation – Critical path method – Time charts and resource leveling – PERT.
TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.
REFERENCES:
1. Paneer Selvam, ‘Operations Research’, Prentice Hall of India, 2002
2. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning, 2002.
3. Winston ‘Operation Research’, Thomson Learning, 2003.
4. Vohra, ‘Quantitative Techniques in Management’, Tata Mc Graw Hill, 2002.
5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.
SUBJECTS

---

---

Elective II

6. CS6003 Ad hoc and Sensor Networks
7. CS6004 Cyber Forensics
8.CS6005 Advanced Database Systems
9. BM6005 Bio Informatics
10. IT6801 Service Oriented Architecture
REFER ELECTIVE SECTION
SUBJECTS

---

---

Elective III

11. IT6005 Digital Image Processing
12. EC6703 Embedded and Real Time Systems
13. CS6006 Game Programming
14. CS6007 Information Retrieval
15. IT6006 Data Analytics
REFER ELECTIVE SECTION
SUBJECTS

---

---

CS6711 Security Laboratory

L T P C
0 0 3 2
OBJECTIVES:
The student should be made to:
Be exposed to the different cipher techniques
Learn to implement the algorithms DES, RSA,MD5,SHA-1
Learn to use network security tools like GnuPG, KF sensor, Net Strumbler
LIST OF EXPERIMENTS:
1. Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES concepts:
a) Caesar Cipher
b) Playfair Cipher
c) Hill Cipher
d) Vigenere Cipher
e) Rail fence – row & Column Transformation
2. Implement the following algorithms
a) DES
b) RSA Algorithm
c) Diffiee-Hellman
d) MD5
e) SHA-1
5 Implement the SIGNATURE SCHEME - Digital Signature Standard
6. Demonstrate how to provide secure data storage, secure data transmission and for creating digital signatures (GnuPG).
7. Setup a honey pot and monitor the honeypot on network (KF Sensor)
8. Installation of rootkits and study about the variety of options
9. Perform wireless audit on an access point or a router and decrypt WEP and WPA.( Net Stumbler)
10. Demonstrate intrusion detection system (ids) using any tool (snort or any other s/w)
SUBJECTS

---

---

CS6712 Grid and Cloud Computing Laboratory

L T P C
0 0 3 2
OBJECTIVES:
The student should be made to:
Be exposed to tool kits for grid and cloud environment.
Be familiar with developing web services/Applications in grid framework
Learn to run virtual machines of different configuration.
Learn to use Hadoop
LIST OF EXPERIMENTS:
GRID COMPUTING LAB
Use Globus Toolkit or equivalent and do the following:
1. Develop a new Web Service for Calculator.
2. Develop new OGSA-compliant Web Service.
3. Using Apache Axis develop a Grid Service.
4. Develop applications using Java or C/C++ Grid APIs
5. Develop secured applications using basic security mechanisms available in Globus Toolkit.
6. Develop a Grid portal, where user can submit a job and get the result. Implement it with and without GRAM concept.
CLOUD COMPUTING LAB
Use Eucalyptus or Open Nebula or equivalent to set up the cloud and demonstrate.
1. Find procedure to run the virtual machine of different configuration. Check how many virtual machines can be utilized at particular time.
2. Find procedure to attach virtual block to the virtual machine and check whether it holds the data even after the release of the virtual machine.
3. Install a C compiler in the virtual machine and execute a sample program.
4. Show the virtual machine migration based on the certain condition from one node to the other. 5. Find procedure to install storage controller and interact with it.
6. Find procedure to set up the one node Hadoop cluster.
7. Mount the one node Hadoop cluster using FUSE.
8. Write a program to use the API's of Hadoop to interact with it.
9. Write a wordcount program to demonstrate the use of Map and Reduce tasks
SUBJECTS