CRYPTOGRAPHY AND NETWORK SECURITY

LTPC
3003

UNIT I FUNDAMENTALS 10
OSI security architecture − Classical encryption techniques − Cipher principles −Data encryption
standard − Block cipher design principles and modes of operation −Evaluation criteria for AES − AES
cipher − Triple DES − Placement of encryption function − Traffic confidentiality.

UNIT II PUBLIC KEY CRYPTOGRAPHY 10

Key management − Diffie-Hellman key exchange − Elliptic curve architecture and cryptography −
Introduction to number theory − Confidentiality using symmetric encryption − Public key cryptography
and RSA.

UNIT III AUTHENTICATION AND HASH FUNCTION 9

Authentication requirements − Authentication functions − Message authentication codes − Hash
functions − Security of Hash Functions and Macs − MD5 Message Digest Algorithm − Secure hash
algorithm − RIPEMD − HMAC Digital Signatures − Authentication protocols − Digital signature
standard.

UNIT IV NETWORK SECURITY 8

Authentication applications − Kerberos − X.509 authentication service − Electronic mail security −
PGP − S/MIME − IP security − Web security.

UNIT V SYSTEM LEVEL SECURITY 8

Intrusion detection − Password management − Viruses and related threats − Virus counter measures −
Firewall design principles − Trusted systems.
Total: 45

TEXT BOOKS
1. William Stallings, “Cryptography and Network Security −Principles and Practices”, 3rd Edition,
Prentice Hall of India, 2003.
2. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.
REFERENCES
1. Forozan, B.A., “Network Security”, PHI, 2002.
2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.
3. Charles B. Pfleeger and Shari Lawrence Pfleeger, “Security in Computing”, 3rd Edition, Pearson
Education, 2003.
4. Maiwald, “Fundamentals of Network Security”, Wiley Student Edition, 2006.
 CS1254 – DATABASE MANAGEMENT SYSTEMS
(Common to CSE and IT)
LTPC
3003
UNIT I FUNDAMENTALS` 9
Purpose of database system – Views of data – Data models – Database languages – Database system
architecture – Database users and administrator – Entity Relationship model (E-R Model ) – E-R
diagrams – Introduction to relational databases.
UNIT II RELATIONAL MODEL 9
The relational model – The catalog – Types – Keys – Relational algebra – Domain relational calculus –
Tuple relational calculus – Fundamental operations – Additional operations – SQL fundamentals –
Integrity – Triggers – Security – Advanced SQL features – Embedded SQL – Dynamic SQL – Missing
information – Views – Introduction to distributed databases and client/server databases.
UNIT III DATABASE DESIGN 9
Functional dependencies – Non-loss decomposition – Functional dependencies – First – Second –
Third normal forms – Dependency preservation – Boyce/codd normal form – Multi-valued
dependencies and fourth normal form – Join dependencies and fifth normal form.
UNIT IV TRANSACTIONS 9
Transaction concepts – Transaction recovery – ACID properties – System recovery – Media recovery –
Two phase commit – Save points – SQL facilities for recovery – Concurrency – Need for concurrency
– Locking protocols – Two phase locking – Intent locking – Deadlock – Serializability – Recovery
Isolation Levels – SQL Facilities for Concurrency.
UNIT V IMPLEMENTATION TECHNIQUES 9
Overview of Physical Storage Media – Magnetic Disks – RAID – Tertiary Storage – File Organization
– Organization of Records in Files – Indexing and Hashing – Ordered Indices – B+ Tree Index Files –
B Tree index files – Static hashing – Dynamic hashing – Query processing overview – Catalog
information for cost estimation – Selection operation – Sorting – Join operation – Database Tuning.
Total: 45
TEXT BOOKS
1. Silberschatz, A., Korth, H.F. and Sudharshan, S., “Database System Concepts”, 5th Edition, Tata Mc-
Graw Hill, 2006
2. Date, C. J., Kannan, A. and Swamynathan, S., “An Introduction to Database Systems”, 8th Edition,
Pearson Education, 2006.
REFERENCES
1. Elmasri, R. and Navathe, S.B., “Fundamentals of Database Systems”, 4 th Edition, Pearson / Addison
Wesley, 2007.
2. Ramakrishnan, R., “Database Management Systems”, 3rd Edition, Mc-Graw Hill, 2003.
3. Singh, S. K., “Database Systems Concepts, Design and Applications”, 1 st Edition, Pearson Education,
2006.
 EC1206 – DIGITAL PRINCIPLES AND SYSTEMS DESIGN
LTPC
3 1 04

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9

Review of Binary Number Systems – Binary Arithmetic – Binary Codes – Boolean Algebra and
Theorems – Boolean Functions – Simplifications of Boolean Functions Using Karnaugh Map and
Tabulation Methods – Implementation of Boolean Functions using Logic Gates.

UNIT II COMBINATIONAL LOGIC 9

Combinational Circuits – Analysis and Design Procedures - Circuits for Arithmetic Operations –
Code Conversion – Hardware Description Language (HDL).

UNIT III DESIGN WITH MSI DEVICES 9

Decoders and Encoders – Multiplexers and Demultiplexers – Memory and Programmable Logic
– HDL for Combinational Circuits

UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC 9

Sequential Circuits – Flip flops – Analysis and Design Procedures - State Reduction and State
Assignment – Shift Registers – Counters – HDL for Sequential Circuits.

UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC 9

Analysis and Design of Asynchronous Sequential Circuits - Reduction of State and Flow Tables –
Race-Free State Assignment – Hazards – ASM Chart.

L: 45 T: 15 Total: 60
TEXT BOOK
1. M. Morris Mano, “Digital Design”, 3rd Edition, Pearson Education, 2007.

REFERENCES
1. Charles H. Roth, “Fundamentals of Logic Design”, 5th Edition, Thomson Learning, 2003.
2. Donald D. Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2007.

COMPILER DESIGN LABORATORY

 LTPC
0032

LIST OF EXPERIMENTS

1 and 2. Implement a lexical analyzer in “C”.

3. Use LEX tool to implement a lexical analyzer.

4. Implement a recursive descent parser for an expression grammar that generates arithmetic

expressions with digits, + and *.

5. Use YACC and LEX to implement a parser for the same grammar as given in problem

6. Write semantic rules to the YACC program in problem 5 and implement a calculator that takes an

expression with digits, + and * and computes and prints its value.

7 and 8. Implement the front end of a compiler that generates the three address code for a simple

language with: one data type integer, arithmetic operators, relational operators, variable

declaration statement, one conditional construct, one iterative construct and assignment

statement.

9 and 10. Implement the back end of the compiler which takes the three address code generated in

problems 7 and 8, and produces the 8086 assembly language instructions that can be

assembled and run using a 8086 assembler. The target assembly instructions can be simple

move, add, sub, jump. Also simple addressing modes are used.