UNIVERSITY VISION AND MISSION

VISION
B.S. Abdur Rahman Institute of Science & Technology aspires to be a leader in
Education, Training and Research in Engineering, Science, Technology and
Management and to play a vital role in the Socio-Economic progress of the Country.

MISSION
• To blossom into an internationally renowned University.

• To empower the youth through quality education and to provide professional
leadership.

• To achieve excellence in all its endeavors to face global challenges.

• To provide excellent teaching and research ambience.

• To network with global Institutions of Excellence, Business, Industry and
Research Organizations.

• To contribute to the knowledge base through Scientific enquiry, Applied Research
and Innovation.

M.Tech. Network Security

2

VISION AND MISSION OF THE DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING

VISION
The vision of the Department of Computer Science and engineering is to impart
quality education, inculcate professionalism and enhance the problem solving skills
of the students in the domain of Computer Science and Engineering with a focus to
make them industry ready, involve in possible areas of research, to pursue and
have continual professional growth.

MISSION
• Equip the students with strong fundamental concepts, analytical capability,
programming and problem solving skills.

• Create an ambience of education through faculty training, self learning, sound
academic practices and research endeavors.

• Facilitate a research culture in the department leading to high quality publications
and funded projects.

• To identify potential areas of research and create centre of excellence in those
areas.

• Provide opportunities to promote organizational and leadership skills in students
through various extra – curricular activities.

• Expose the students to emerging and upcoming technologies through co-
curricular events.

• To make the students as for as possible industry ready to enhance their
employability in the industries.

• To improve department industry collaboration through internship programme
and interaction with professional society through seminar/workshops.

• Imbibe social awareness and responsibility in students to serve the society.

Network Security 4 .Tech.M.

• Be able to apply tools and techniques for solving problems of network security relevant to the society. • To undertake research in network security. . • Work as a team exhibiting effective system administrative skills. • To equip the graduates with required strategies and tools for design and development of secure network systems. PROGRAMME OUTCOMES On completion of the programme the graduates will • Have knowledge in practices and procedures adopted for software development in security domains. PROGRAMME EDUCATIONAL OBJECTIVES AND OUTCOMES M.Tech. (Network Security) PROGRAMME EDUCATIONAL OBJECTIVES • To provide advanced knowledge and skills required in the area of network security. • To impart knowledge to analyze and propose new schemes for the protection system relevant to industry. • Be able to undertake need based research with a focus on industry related issues in network security.

M.Tech. Network Security 6 .

DEGREE PROGRAMMES . REGULATIONS 2013 FOR M.TECH.

Network Security 8 .M.Tech.

REGULATIONS . iii) "University" means B. Computer Aided Design.1 P.G.S. unless the context otherwise requires i) "Programme" means Post Graduate Degree Programme (M. Full Time M.Tech. DEGREE PROGRAMMES 1. etc. like Applied Mathematics.S. vii) "Dean (Student Affairs)" means Dean(Student Affairs) of B. Full Time .) ii) "Course" means a theory or practical subject that is normally studied in a semester. v) "Academic Council" means the Academic Council of this University. Part Time .Tech. Structural Dynamics. vi) "Dean (Academic Affairs)" means Dean (Academic Affairs) of B.Abdur Rahman University.Abdur Rahman University. Chennai.0 PRELIMINARY DEFINITIONS AND NOMENCLATURE In these Regulations. 2.0 PROGRAMMES OFFERED. MODE OF STUDY AND ADMISSION REQUIREMENTS 2.G.S. 600048.Abdur Rahman University who is responsible for conduct of examinations and declaration of results. Programmes Offered The various P.Sc.C. Full Time M.Sc.TECH / MCA / M.2013 FOR FOR M. iv) "Institution" unless otherwise specifically mentioned as an autonomous or off campus institution means B.Abdur Rahman University. viii) "Controller of Examinations" means the Controller of Examinations of B. Programmes and their modes of study are as follows: Degree Mode of Study M.Day / Evening M./ MCA / M.A.Abdur Rahman University.S.S. Sc.Tech.

Network Security 2.Day Time programme shall have his/her permanent place of work within a distance of 65km from the campus of this Institution. 2. 2.3 ADMISSION REQUIREMENTS 2. 2.4 A student eligible for admission to M.2 A full time student. co-curricular and extra-curricular activities assigned to them. 2.Evening In this mode of study.. 2. the students are required to attend normally classes in the evening and on Saturdays.2. 2.2 Eligibility conditions for admission such as class obtained.2. which may be prescribed by this Institution from time to time. Such conversion is not permitted in the middle of a semester.2.Day time In this mode of study.4 of this Regulations.1 Students for admission to the first semester of the Master's Degree Programme shall be required to have passed an appropriate degree examination of this University as specified in Table shown for eligibility entry qualification for admission to PG Programmes or any other degree examination of any University or authority accepted by this University as equivalent thereto.M.Tech. sponsorship etc. the students are required to attend classes for the courses registered along with full time students.3.3.1 Full-time Students admitted under "Full-Time" shall be available in the Institution during the complete working hours for curricular.2.3 Part time .2. if necessary.3. number of attempts in the qualifying examination and physical fitness will be as prescribed by this Institution from time to time. who has completed all non-project courses desiring to do the Project work in part-time mode for valid reasons.3. Permission may be granted based on merits of the case.3 All part-time students should satisfy other conditions regarding experience. if the student satisfies the clause 2.Tech.5 A part time student is not permitted to convert to full time mode of study. 2. 10 .4 Part time .2 MODES OF STUDY 2. shall apply to the Dean (Academic Affairs) through the Head of the Department. 2.3. Part Time .

Project work / thesis / dissertation iv.1 The minimum and maximum period for completion of the P. Seminars vii. Core courses ii.3 The curriculum and syllabi of all the P.Sc.Tech.2 The P. programmes shall be approved by the Academic Council of this University. PROGRAMME 3. 3. of Semesters M. Case studies vi. (Full Time) 6 12 M. Industrial Internship 3. (Full Time) 4 8 3. Network Security 3.G.G. No.G.(Part Time) 6 12 M.M.G.0 DURATION AND STRUCTURE OF THE P. Elective courses iii. Semester-end examinations will follow immediately after the last working day.4 The minimum number of credits to be earned for the successful completion of the programme shall be specified in the curriculum of the respective specialization of the P. (Full Time) 4 8 M.Tech. Programmes are given below: Programme Min. Laboratory Courses v.A. programme.5 Each academic semester shall normally comprise of 80 working days. 3. programmes will consist of the following components as prescribed in the respective curriculum i.C. of Semesters Max.G.Tech. 11 . No.

E / B. / B. Department offered admission M.E.Tech.Tech.G.E.A.Tech.Tech. (Systems Engineering and BE / B. (EIE/ICE/Electronics/ECE/ 07. (Structural Engineering) B.E / B./ B.E. (Any Branch) or M.Tech.Tech. (Information Technology) B. Programmes Qualifications for No. (CSE / IT) MCA Engineering M.E /B.E.M.C. (Maths / Physics / Statistics / CS / IT / SE) or M.Tech. (ECE / EEE / Electronics / 06.Tech. /B. Network Security ELIGIBLE ENTRY QUALIFICATIONS FOR ADMISSION TO P. Polymer Technology M.A. Operations Research) (Maths / Physics / Statistics / CS / IT / SE) or M.Tech. Mechanical M. (Power Systems Engg) B.Tech. (CSE/IT/ECE/EEE/EIE/ICE/ Electronics / MCA) M.Sc (Polymer Sc.Tech (Computer and Predictive B.E / B./ B.Tech. Electronics M. Civil Engineering M.Tech (Network Security) B. PROGRAMMES Sl. M.Tech. (CSE/IT/ECE/EEE/EIE/ICE/ Analytics) Electronics / MCA) M.E.Tech. with Physics Dept EIE / ICE) M. Communication Electronics / Instrumentation) Engineering M.E / B. (IT/CSE/ECE/EEE/EIE/ICE/ Forensics) Electronics) MCA Bachelor Degree in any discipline with M.Tech. (Software Engineering) B. (Civil Engineering) / and Project Management) (Structural Engineering) B. (Polymer Technology) Polymer Science or Engg or Tech / Rubber Tech / M.E.G.Tech.Tech. (Communication Systems) B.Tech. (Optoelectronics and Laser B. (Electronics and B.Tech (EEE/ ECE / E&I / I&C / 05.E. Computer Science and M./Production/ 03. /B.Sc (Physics / Materials Technology) Science / Electronics / Photonics) Electronics and M.C./B.E /B.Tech. (Civil Engineering) / (Structural Engineering) 01. Chemistry) M.. /B. (Information Security & Digital B. (Data & Storage Management) BE / B.Tech.Tech. in ECE / Electronics / EIE ECE Department jointly M.(VLSI and Embedded Systems) B..Tech. (Any Branch) or M.E.Tech.Sc. Instrumentation Instrumentation Engineering) EEE) Engineering M. (Power Electronics & Drives) B.Tech (EEE / ECE / E&I / I&C / Engineering Electronics / Instrumentation) Electronics and M.Tech (EEE / ECE / E&I / I&C / Electrical and Electronics / Instrumentation) 04./ Chemistry Appl.Tech. (Computer Science and B. (CSE/IT/ECE/EEE/EIE/ICE/ Engineering) Electronics / MCA) 08.Tech./ B. / B.C.Tech.Tech. / B. degree Mech.Tech. (Mechanical / Auto / 02. (IT/CSE/ECE/EEE/EIE/ICE/ Electronics) MCA 09 InformationTechnology M.Tech. (Manufacturing Engineering) Manufacturing / Production / Industrial / Engineering Mechatronics / Metallurgy / Aerospace /Aeronautical / Material Science / Marine Engineering) B.E.Tech.E.A.Tech. 12 .Tech.Sc.Tech. Mathematics as one of the subjects (or) Mathematics at +2 level 10 Computer Applications M. (Construction Engineering B. Name of the P.

Name of the P. (Applied Science) 3. 75 to 85 3.G.A. (Part Time) 6 to 18 12 to 16 M. PROGRAMMES Sl.G.G.C. (Actuarial Science) Any Degree with Mathematics / Statistics as one of the Subjects of Study. programmes as given below: * One credit for one lecture period per week * One credit for one tutorial period per week * One credit each for seminar/practical session/project of two or three periods per week * one credit for two weeks of industrial internship. 3.Sc (Chemistry) of B.G. Programme Non-project Semester Project semester M. (Full Time) 15 to 25 12 to 20 3.8 The number of credits registered by a student in non-project semester and project semester should be within the range specified below: P. 12 Chemistry M. (Full Time) 15 to 29 12 to 20 M.A.Tech. Network Security ELIGIBLE ENTRY QUALIFICATIONS FOR ADMISSION TO P.Sc.(Chemistry) B. Programmes Qualifications for No.M.6 The curriculum of P. 75 to 85 M. programmes shall be so designed that the minimum prescribed credits required for the award of the degree shall be within the limits specified below: Programme Minimum prescribed credit range M.Tech. 120 to 130 M. Department offered admission 11 Mathematics M.9 The electives from the curriculum are to be chosen with the approval of the Head of the Department.Sc.Sc. 13 .Sc.C.7 Credits will be assigned to the courses for all P.Sc.Tech. (Full Time) 15 to 29 12 to 20 M.G.Tech.

in which the special elective course is offered. 3. if specified in the curriculum shall be of not less than two weeks duration and shall be organized by the Head of the Department.3 Project work / Thesis / Dissertation (Phase . such course shall be ratified by the Board of Studies and Academic Council.II in the case of M. Network Security 3. following the preliminary work carried out in Phase-1 during the previous semester.) shall be pursued for a minimum of 16 weeks during the final semester.4 The Project Report/Thesis / Dissertation report / Drawings prepared according to approved guidelines and duly signed by the supervisor(s) and the Head of the Department shall be submitted to the concerned department. 14 .1 Project work / Thesis / Dissertation shall be carried out under the supervision of a qualified teacher in the concerned Department.12 The medium of instruction. the project work shall be jointly supervised by a faculty of the Department and an Engineer / Scientist from the organization and the student shall be instructed to meet the faculty periodically and to attend the review committee meetings for evaluating the progress.2 A student may however. 3. 3. 3. provided the Heads of the Departments offering such courses also agree.14. Programmes either within the Department or from other Departments up to a maximum of three courses during the period of his/her study. provided the syllabus of this course is recommended by the Head of the Department and approved by the Chairman.M. 3. in certain cases. examination.Tech. In such cases. seminar and project/thesis/ dissertation reports will be English. 3.14.14. "Special Electives" may be offered. A student may be permitted to register for a "Special Elective" up to a maximum of three credits during the period of his/her study. 3. Subsequently.14. Academic Council before the commencement of the semester.13 Industrial internship.14 PROJECT WORK/THESIS/DISSERTATION 3.G.Tech.10 A student may be permitted by the Head of the Department to choose electives offered from other P. be permitted to work for the project in an Industrial/Research Organization.11 To help the students to take up special research areas in their project work and to enable the department to introduce courses in latest/emerging areas in the curriculum. on the recommendation of the Head of the Department.

and guide the students in taking up courses for registration and enrolment every semester. He/she is responsible for maintaining the academic. 5.1 Every class of the P. curricular and co- curricular records of all students throughout their period of study.G. One senior faculty preferably not offering courses for the class.0 CLASS ADVISOR AND FACULTY ADVISOR 4. Such Faculty Advisor shall offer advice to the students on academic and personal matters.14. 3. constituted by the Head of the Department as follows: i.5 The deadline for submission of final Project Report / Thesis / Dissertation is within 30 calendar days from the last working day of the semester in which Project / Thesis / Dissertation is done.1 CLASS ADVISOR A faculty member will be nominated by the HOD as Class Advisor for the whole class. 4. 3.6 If a student fails to submit the Project Report / Thesis / Dissertation on or before the specified deadline he / she is deemed to have not completed the Project Work / Thesis / dissertation and shall re-register the same in a subsequent semester.7 A student who has acquired the minimum number of total credits prescribed in the Curriculum for the award of the Masters Degree will not be permitted to enroll for more courses to improve his/her cumulative grade point average (CGPA). the Head of the Department of the students will attach a certain number of students to a faculty member of the department who shall function as Faculty Advisor for the students throughout their period of study. Teachers of all courses of the programme ii.14. Network Security 3.2 FACULTY ADVISOR To help the students in planning their courses of study and for general counseling on the academic programme. as chairperson.Tech. nominated by the Head of the Department. Programme will have a Class Committee.14.0 CLASS COMMITTEE 5.M. 15 . Minimum two students of the class. iii. 4.

Ex-Officio Member.2 The Class Committee shall be constituted by the respective head of the department of the students.M. after the semester-end examination to finalize the grades 6. 7. 7. the Course Committee may also prepare a common question paper for the test(s). 5. The type of assessment for the course will be decided by the teacher in consultation with the Class Committee and will be announced to the students at the beginning of the semester. Programme . Network Security iv.3 The basic responsibilities of the Class Committee are to review periodically the progress of the classes.Ex-Officio Members v. The nomination of the Course coordinator shall be made by the Head of the Department / Dean(Academic Affairs) depending upon whether all the teachers teaching the common course belong to a single department or to several departments.0 REGISTRATION AND ENROLMENT 7. The curriculum gives details of the core and elective 16 . 5. without the student members.G. to discuss problems concerning curriculum and syllabi and the conduct of classes. Each Class Committee will communicate its recommendations to the Head of the Department and Dean(Academic Affairs). 5. Class Advisor / Faculty Advisor of the class .1 For the first semester every student has to register and enroll for all the courses. first within a week of the commencement of the semester.Tech. The Course Committee shall meet as often as possible and ensure uniform evaluation of the tests and arrive at a common scheme of evaluation for the tests. after the first assessment and the third. second.2 For the subsequent semesters registration for the courses will be done by the student during a specified week before the semester-end examination of the previous semester.4 The Class Committee is required to meet at least thrice in a semester. Wherever it is feasible.0 COURSE COMMITTEE Each common theory course offered to more than one group of students shall have a "Course Committee" comprising all the teachers teaching the common course with one of them nominated as Course coordinator. Professor in-charge of the P. The class committee. will also be responsible for finalization of the semester results.

7. Network Security courses. 17 . The student should consult his/her Faculty Adviser for the choice of courses.5 Withdrawal from a course registered is permitted up to one week from the date of the completion of the first assessment test. 7. 7. 7. on the recommendation of the HOD. Late enrolment will be permitted on payment of a prescribed fine up to two weeks from the date of commencement of the semester.7. A student will become eligible for enrolment only if he/she satisfies clause 9 and in addition he/she is not debarred from enrolment by a disciplinary action of the Institution.7.Tech.7 SUMMER TERM COURSES 7.6 Change of a course within a period of 15 days from the commencement of the course. At the time of enrolment a student can drop a course registered earlier and also substitute it by another course for valid reasons with the consent of the Faculty Adviser.6.1 Summer term courses may be offered by a department on the recommendation of the Departmental Consultative Committee and approved by the Dean (Academic Affairs). A student will have to register within the time stipulated in the announcement.2 Summer term courses will be announced by the Head of the department at the end of the even semester before the commencement of the end semester examinations.1 Courses withdrawn will have to be taken when they are offered next if they belong to the list of core courses.3 The number of contact hours and the assessment procedure for any course during summer term will be the same as those during regular semesters. is permitted. 7. A student has to pay the fees as stipulated in the announcement.4 From the second semester onwards all students shall pay the prescribed fees and enroll on a specified day at the beginning of a semester. 7.M. No student should register for more than three courses during a summer term. The Registration form shall be filled in and signed by the student and the Faculty Adviser. 7. project and seminar to be taken in different semester with the number of credits.7. with the approval of Dean (Academic Affairs).

Sc. if they wish to improve their continuous assessment marks subject to the approval of the Head of the department.0 TEMPORARY BREAK OF STUDY FROM THE PROGRAMME A student may be permitted by the Dean (Academic Affairs) to avail temporary break of study from the programme up to a maximum of two semesters for reasons of ill health or other valid grounds. of credits to be earned to enroll for project semester M.0 MINIMUM REQUIREMENTS TO REGISTER FOR PROJECT / THESIS / DISSERTATION 9. Network Security Students with U grades will have the option either to write semester end arrears exam or to redo the courses during summer / regular semesters. he/she has to earn the required credits.Tech.1 Every student is required to observe discipline and decorous behaviour both inside and outside the campus and not to indulge in any activity.7.Tech.1 and then register for the project semester.1). which will tend to bring down the prestige of the Institution. 8.A.2 If the student has not earned minimum number of credits specified. 7. at least to the extent of minimum credits specified in clause 9.(Full-time) 30 (IV semester) if project is in IV semester 18 (III semester) if project is in III semester 9.Tech.C. if he/she has earned the minimum number of credits specified below: Programme Minimum No. (Full time) 45 (V semester) M. However the total duration for completion of the programme shall not exceed the prescribed maximum number of semesters (vide clause 3. Such student has to rejoin only in the same semester from where he left.4 Withdrawal from a summer term course is not permitted. (Full time) 18 (III semester) M. (Part-time ) 18 (V semester) M. 10. 18 .1 A student is permitted to register for project semester.M.0 DISCIPLINE 10. No substitute examination will be conducted for the summer term courses. 9.

2 Any act of indiscipline of a student reported to the Head of the Institution will be referred to a Discipline and Welfare Committee for taking appropriate action.1 Attendance rules for all Full Time Programme and Part time . 11./ M. The evaluation will be made based 19 .Tech. in each lecture based course. to become eligible to appear for the semester-end examination in that course. subject to a maximum relaxation of 25% for genuine reasons like on medical grounds.C.day Time Programmes are given in the following sub-clause.1 The following rule shall apply to the full-time and part-time P. failing which the student shall be awarded "I" grade in that course. an Internal Examiner and External Examiner to be appointed by the Controller of Examinations. representing the University in approved events etc. If the course is an elective.2 Ideally every student is expected to attend all classes and earn 100% attendance in the contact periods of every course.2 There shall be one examination of three hours duration. 11.4 At the end of industrial internship. Network Security 10.Sc.0 ATTENDANCE 11.G. The assessment procedure as decided in the Class Committee will be announced to the students right at the beginning of the semester by the course teacher.0 ASSESSMENTS AND EXAMINATIONS 12. 10.A. normally a minimum of two assessments will be made during the semester. 12. 12. 12. The assessments may be combination of tests and assignments. the student should register for and repeat the course when it is offered next.Tech. 12.. the student shall submit a certificate from the organization and also a brief report.M. either he/she can register and repeat the same elective or can register for a new elective.3 The evaluation of the Project work will be based on the project report and a Viva-Voce Examination by a team consisting of the supervisor concerned. at the end of the semester. / M. programmes (M.3 Every student should have been certified by the HOD that his / her conduct and discipline have been satisfactory. If the course is a core course.) For lecture-based courses.

20% Viva-Voce Examination .1. However.2 A student who misses any assessment in a course shall apply in a prescribed form to the Dean (Academic Affairs) through the Head of the department within a week from the date of missed assessment. laboratory work and examinations will be on absolute basis.2 Appearing for semester end examination for each course (Theory and Practical) is mandatory and a student should secure a minimum of 40% marks in semester end examination for the successful completion of the course. 14.30% 13.M.25% Project work Periodic reviews . Network Security on this report and a Viva-Voce Examination.1 The following shall be the weightages for different courses: i) Lecture based course Two continuous assessments .Tech. The final percentage of marks is calculated in each course as per weightages given in clause 13.0 SUBSTITUTE EXAMINATION 14. 13.0 WEIGHTAGES 13. such as accident or admissions to a hospital due to illness.3 The markings for all tests. 20 . 13.1 A student who has missed for genuine reasons any one of the three assessments including semester-end examination of a course may be permitted to write a substitute examination. etc.50% Evaluation of Project Report by External Examiner . 14. assignments (if any).50% ii) Laboratory based courses Laboratory work assessment . conducted internally by a Departmental Committee constituted by the Head of the Department. tutorial.75% Semester-end examination . However the substitute tests and examination for a course will be conducted within two weeks after the last day of the semester-end examinations.50% Semester-end examination . permissions to take up a substitute examination will be given under exceptional circumstances.

0 COURSEWISE GRADING OF STUDENTS AND LETTER GRADES 15.1 Based on the semester performance.3 A course successfully completed cannot be repeated for any reason. each student is awarded a final letter grade at the end of the semester in each course. 15.2 A student is considered to have completed a course successfully if he / she secure five grade points or higher. 16. "U" denotes unsuccessful performance in a course. The letter grades and the corresponding grade points are as follows. Network Security 15.1 A final meeting of the Class Committee without the student member(s) will be convened within ten days after the last day of the semester end 21 . "I" denotes inadequate attendance and hence prevention from semester- end examination. "AB” denotes Absent for the semester end examination 15.Tech.0 AWARD OF LETTER GRADE 16.M. but grading has to be relative grading Letter grade Grade points S 10 A 9 B 8 C 7 D 6 E 5 U 0 I - W - AB - Flexible range grading system will be adopted "W" denotes withdrawal from the course. A letter grade U in any course implies unsuccessful performance in that course.

2 After finalisation of the grades at the class committee meeting the Chairman will forward the results to the Controller of Examinations. 16. The letter grades to be awarded to the students for different courses will be finalized at the meeting.3 The "U" and "AB" grade once awarded stays in the grade sheet of the students and is not deleted when he/she completes the course successfully later. 18. within one week from the announcement of results. The grade acquired by the student later will be indicated in the grade sheet of the appropriate semester. the teacher concerned and a teacher of the department who is knowledgeable in the concerned course. with copies to Head of the Department and Dean (Academic Affairs).1 A student should register to re-do a core course wherein "I" or "W" grade is awarded. 18. along with the regular examinations of next semester courses. 22 .0 DECLARATION OF RESULTS 17.2 A student who is awarded "U" or "AB" grade in a course shall write the semester-end examination as arrear examination.Tech.0 COURSE REPETITION AND ARREARS EXAMINATION 18.1 After finalisation by the Class Committee as per clause 16. or "W" grade in an elective course either the same elective course may be repeated or a new elective course may be taken. 17.1 the Letter Grades awarded to the students in the each course shall be announced on the departmental notice board after duly approved by the Controller of Examinations. If the Committee finds that the case is genuine. he/she can apply for revaluation after paying the prescribed fee for the purpose. If the student is awarded "I".M.2 In case any student feels aggrieved about the results. Network Security examination. A committee will be constituted by the concerned Head of the Department comprising of the Chairperson of the concerned Class Committee (Convener). 17. it may jointly revalue the answer script and forward the revised marks to the Controller of Examinations with full justification for the revision if any. at the end of the next semester. 17.

19.3 The marks earned earlier in the continuous assessments for the course.M. U. 19.Grade point obtained in the ith course for the cumulative grade point average (CGPA) a similar formula is used except that the sum is over all the courses taken in all the semesters completed up to the point of time.2 The GPA will be calculated according to the formula ∑ in=1 (C i )(GPi ) GPA = Where n = number of courses ∑ in=1 C i where Ci is the number of credits assigned for ith course GPi . (ii) the performance in each course by the letter grade obtained. 19. I and W grades will be excluded for CGPA calculations.3 Classification of the award of degree will be as follows: CGPA Classification 8. I and W grades will be excluded for GPA calculations.50 and above. Network Security 18. will be used for grading along with the marks earned in the semester end arrear examination of the course. having completed First class with Distinction all courses 6.1 The grade sheet issued at the end of the semester to each student will contain the following: (i) the credits for each course registered for that semester. having completed within a period of 2 semesters beyond the programme period First Class All others Second Class 23 . (iii) the total credits earned in that semester. AB.50 and above.Tech.0 GRADE SHEET 19. (iv) the Grade Point Average (GPA) of all the courses registered for that semester and the Cumulative Grade Point Average (CGPA) of all the courses taken up to that semester.

Network Security However. to be eligible for First Class with Distinction.G. if he/she has: i) successfully acquired the required credits as specified in the Curriculum corresponding to his/her programme within the stipulated time.M. if any (clause 8). 21. the Academic Council has the right to modify any of the above regulations from time to time. CGPA will be considered up to three decimal places. 20.0 POWER TO MODIFY Notwithstanding all that have been stated above. The students who do not satisfy the above two conditions will be classified as second class.Tech. To be eligible for First Class.1) plus authorized break of study. For this purpose. For the purpose of comparison of performance of students and ranking.0 ELIGIBILITY FOR THE AWARD OF THE MASTERS DEGREE 20.2 The award of the degree must be approved by the University. ii) no disciplinary action is pending against him/her 20. Programme within a minimum period covered by the minimum duration (clause 3. 24 . the CGPA will be rounded to two decimal places. a student should have passed the examination in all courses within the specified minimum number of semesters reckoned from his/her commencement of study plus two semesters. a student should not have obtained U or I grade in any course during his/her study and should have completed the P. the authorized break of study will not be counted.1 A student shall be declared to be eligible for the award of the Masters Degree. For the purpose of classification.

(NETWORK SECURITY) (FOUR SEMESTERS / FULL TIME) CURRICULUM SEMESTER I Sl. Code Theory 1 CSB6251 Modern distributed Network system 3 0 0 3 2 CSB6252 Applied Cryptography & Network Security 3 0 0 3 3 CSB6253 Digital and Cyber Forensics 3 0 0 3 4 CSB6232 Information Security 3 0 0 3 5 Elective II 3 0 0 3 6 Elective III 3 0 0 3 25 . Course Course Title L T P C No.I 3 0 0 3 6 CSB6101 Research Methodology for Engineers 3 1 0 4 Practical 1 CSB6143 Computer security lab 0 0 3 1 2 CSB6144 Term Paper / Seminar 0 0 2 1 24 SEMESTER II Sl. Code Theory 1 MAB6190 Statistical Techniques for Network Security 3 1 0 4 2 CSB6103 Data Structures & Analysis of Algorithms 3 0 2 4 3 CSB6104 Computer Networks & Management 3 0 2 4 4 CSB6142 Computer Security 3 0 0 3 5 Elective .Tech. Course Course Title L T P C No.TECH.M. Network Security CURRICULUM & SYLLABI FOR M.

Network Security Practical 1 CSB6254 Cryptography lab 0 0 3 1 2 CSB6255 Information Security (Case Study) 0 0 3 1 20 SEMESTER III Sl. Code 1 CSB7241 Project .M. Code Theory 1 Elective IV 3 0 0 3 2 Elective V 3 0 0 3 3 Elective VI 3 0 0 3 4 SSB7181 Society. Course Course Title L T P C No. Course Course Title L T P C No. Technology and Sustainability 3 0 0 3 5 CSB7201 Software Project Management 3 0 0 3 6 CSB7241 Project .Phase II 0 0 36 18* Total 18+6=24 *Credits for Project Work (Phase I) to be accounted along with Project work (Phase II) in IV Semester TOTAL CREDITS : 83 26 .Phase I 0 0 12 6* 15 SEMESTER IV Sl.Tech.

Course Course Title No.M. Network Security LIST OF ELECTIVES Sl. Code 1 CSBY51 Intrusion Detection 2 CSBY52 Game theory and its Applications 3 MAB6194 Operations Research 4 CSBY53 Public Key Infrastructure & Key management 5 CSBY54 Mobile & Wireless Network security 6 CSBY55 Technical Foundation of E-commerce 7 CSBY56 Biometric Security 8 CSBY02 Soft Computing 9 CSBY08 Embedded Systems 10 CSBY57 Security issues in Cloud Computing 11 CSBY24 Service Oriented Architecture 12 CSBY58 Secure Software Systems 13 CSBY59 Advanced Digital Forensics 14 CSBY60 Advanced Algorithms 15 CSBY61 Human Aspects of Computer Security 16 CSBY18 Hacking Techniques & Digital Forensics 17 CSBY22 Object Oriented Software Engineering 18 CSBY25 Cloud Computing 27 .Tech.

MODULE VI DECISION ANALYSIS AND EVALUATION 8 Analysis of Uncertainity – Statistical Control Chart – Ranking –Data Evaluation 28 . • Study the use of measurements in modelling.I MAB6190 STATISTICAL TECHNIQUES FOR L T P C NETWORK SECURITY 3 1 0 4 OBJECTIVES: • Become familiar with the state -of . understanding and improving a network. MODULE I FOUNDATIONS 7 Statistical Approaches and Opportunities – Fundamental Statistical Roles and Challenges in Network Security – Statistical Analysis Software. MODULE II NETWORK TRAFFIC AND DATA CHARACTERISTICS 7 System Specific Data. MODULE V CLASSIFICATION 8 Supervised Learning – Generalized Linear Methods – Nonparametric Methods – Nonlinear Methods – Unsupervised Learning – Probability Models – Similarity Models – Multidimensional Models.M. • Learn several statistical tools for the analysis of network measurements.art in network measurement.the .User Specific Data – Publicly Available Data – Random Variables – Variable Distributions – Network Data Modules MODULE III NETWORK DATA MINING AND MODELING 7 Exploring Network Data – Descriptive Analysis – Visualizing Analysis – Data Transformation – Data Reduction – Data Structure Detection – Sampling Network Traffic – Sample Size MODULE IV ASSOCIATION AND PREDICTION 8 Bivariate Analysis – Linear Regression Modeling – Robustness Association – Use Behaviour Pattern – Scoring Methods – Profiling Models.Tech. Network Security SEMESTER .

“Statistical Analysis of Network Data: Methods and Models”. classify and evaluate Network Data. Validity and Quality – Goodness of Classification – Performance Assessment. 29 . • explain the procedures to predict. IGI Global. 2. 2008. • analyze and process the data. “Statistical Techniques for Network Security: Modern Statistically- Based Intrusion Detection and Protection”. T-15. Springer.Tech. Total Hours: 60 REFERENCES: 1.M. L-45. Kolaczyk. Yan Wang. Network Security – Data Reliability. OUTCOMES: Students who complete this course will be able to • state applications of statistics in Network Security and apply them in Network Security problems. Springer Series in Statistics. Eric D. 2009.

and Average Cases .Proof by Mathematical Induction – Algorithm Analysis – Best.M.Upper Bounds . CPA)) OBJECTIVES: • To provide knowledge in various data structures and algorithms. Worst.Sets and Relations - Miscellaneous Notation . • To introduce techniques for analyzing the efficiency of computer algorithms • To provide knowledge in the systematic way of solving problems. • To analyze algorithms and to determine algorithm correctness and time efficiency class.Proof by Contradiction .Direct Proof . MODULE III SORTING AND SEARCHING 8 Internal Sorting Techniques – Heap Sort – Quick sort – Merge Sort – Binsort and Radix Sort – Multi Way Merging .Abstract Data Types and Data Structures .Calculating the Running Time for a Program .Logarithms -Summations and Recurrences - Recursion .Time complexity Analysis of Sorting Techniques – Searching Unsorted and Sorted Arrays – Self – Organizing Lists – Hashing.Asymptotic Analysis .Empirical Analysis MODULE II ELEMENTARY DATA STRUCTURES 7 List – Stacks – Queues – Binary Trees – Binary Search Trees – Huffman Coding Trees – Non – Binary Trees.Tech (CSE. MODULE I INTRODUCTION 9 The Need for Data Structures .Tech.Analyzing Problems .Costs and Benefits . various methods of organizing large amounts of data. NS. Network Security CSB6103 DATA STRUCTURES AND ANALYSIS OF L T P C ALGORITHMS 3 0 2 4 (Common to M. MODULE IV ADVANCED DATA STRUCTURES 7 Elementary Graph Algorithms – Minimum Spanning Tree – Single Source 30 .Mathematical Proof Techniques .Mathematical Preliminaries .Notation .Lower Bounds .

P-15. 31 . Leiserson. Clifford A. “Data Structure and Algorithm Analysis in C++”.Coping with NP -Complete Problems . Charles E. “Introduction to Algorithms”. Rivest.Tech. MODULE V ALGORITHMIC TECHNIQUES 7 Dynamic Programming – Greedy Algorithms – Number-Theoretic Algorithms – String Matching algorithms. Total Hours: 60 REFERENCES: 1. 2. 2009.Hard Problems . Ronald L. Network Security Shortest Path – All-Pairs shortest Path – Balanced Trees – AVL Trees. PHI Learning. Cormen.Red- Black Trees – Splay Trees – B-Trees – 1-2-3 Trees. L-45. Shaffer. Clifford Stein. 3. • assess how the choice of data structures and algorithm design methods impacts the performance of programs • employ the different data structures and algorithmic techniques to find the solutions for specific problems. OUTCOMES: Students who complete this course will be able to • choose the appropriate data structure and algorithm design method for a specified application. Mark Allen Weiss. 3rd Edition. 3rd Edition. Dover Publications. 2006. Prentice Hall.The Theory of NP -Completeness – NP - Completeness Proofs . Thomas H. 2011. 3rd Edition. “Data Structures and Algorithm Analysis in C++”. MODULE VI LIMITS TO COMPUTATION 7 Reductions .M.Impossible Problems – Uncountability.

ATM Packet - Integrated service . Communications protocols and standards. • To introduce the concepts. Routers.ATM Network Management-ATM Network reference model. Macros Functional model CMIP/CMIS.The information model - Communication Model . Gateways.M1. paradigms and functions as well as the underlying applications and tools for network management. WAN. MODULE V NETWORK MANAGEMENT APPLICATIONS 8 Configuration management . M4 Interface. MODULE III INTERNET MANAGEMENT 7 SNMP-Organizational model-System Overview .Organizational model -Information model.Tech (CSE.Report Management.Virtual LAN . Bridges.Fault management .ATM Management Information base-Role of SNMD and ILMI in ATM Management. Network node components. protocol remote monitoring.Policy Based Management Service Level Management. 32 .M.ATMLAN emulation .Event Correlation Techniques security Management .SNMP proxy server. M2.Accounting management . ISDN Transmission Technology. MODULE II OSI NETWORK MANAGEMENT 7 OSI Network management model.Functional model .Tech. Abstract Syntax Notation . Switches. M3. Communication model. MODULE I FUNDAMENTALS OF COMPUTER NETWORK TECHNOLOGY 7 Network Topology.Encoding structure.VC . NS. LAN. SE)) 3 0 2 4 OBJECTIVES: • To introduce the operation and management of computer networks.Performance management . Network Security CSB6104 COMPUTER NETWORKS AND MANAGEMENT L T P C (Common to M. MODULE IV BROADBAND NETWORK MANAGEMENT 8 Broadband networks and services .ATM Technology-VP.ATM Digital Exchange Interface Management.Management information.Hubs. integrated local management Interface.

M.Tech. Network Security
MODULE VI APPLIED NETWORK MANAGEMENT 8

The Need for Management Integration- Management Integration challenge -
Approaches to Management Integration- Service Level Management-The
Motivation for Service Level Agreements - Identification of Service Level
Parameters - Defining a Service Level Agreement- Managing for a Service
Level.

L-45; P-15; Total Hours: 60
REFERENCES:
1. Mani Subramanian, “Network Management: Principles and Practices”, 2nd
Edition, Prentice Hall, 2012.
2. Alexander Clemm, “Network Management Fundamentals”, 1st Edition, Cisco
Press, 2006.
3. Adrian Farrell, “Network Management Know It All”, 1st Edition, Elsevier India,
2008.
4. Richard Burke, “Network Management: Concepts & Practice, A Hands on
Approach”, 1st Edition, Prentice Hall, 2003.

OUTCOMES:
Students who complete this course will be able to
• address the fundamental importance of network information management
related to the business objectives of an organization.
• use computer network management tools and the systems.
• have knowledge of current developments in information and communication
technologies, standards and applications.

33

M.Tech. Network Security
CSB6142 COMPUTER SECURITY L T P C
3 0 0 3
OBJECTIVES:
• To provide a solid understanding of the main issues related to security in
modern computer systems.
• To provide basic knowledge about security-relevant decisions in designing IT
infrastructures, techniques to secure complex systems and practical skills
in managing a range of systems, from personal laptop to large-scale
infrastructures.

MODULE I INTRODUCTION 7

Physical Security – Viruses – Worms – Trojan Horses –Principles of Computer
Security.

MODULE II IDENTITY THEFT AND PRIVACY 7

Identity Theft- Shredding – Internet Cookies –Phishing – Homograph Threat –
Privacy Issues- Trust.

MODULE III ELEMENTS OF CRYPTOGRAPHY 7

Principles of Cryptography - Modular Arithmetic - Integrity Check Functions -
Kirchoff’s Principle – Monoalphabetic -Polyalphabetic Cipher – One Time Pad
– Key distribution Problem – Diffie Hellman Key Merkle Keys- Public Key
Cryptography – RSA – SSL - Digital Signatures – Encryption - Strength of
Mechanisms –Performance.

MODULE IV NETWORK SECURITY 9

Internet Vulnerabilities- Port Scanning – Spoofs – Spams - Denial of Service –
Firewall Basics - Authentication – Local Authentication – Biometric Techniques
– Passwords - Access Control Background - Authentication and Authorization
- Access Operations - Access Control Structures- Ownership-Intermediate
Control - Policy Instantiation - Comparing Security Attributes.

MODULE V DATABASE SECURITY 8

Introduction - Relational Databases- Access Control - Statistical Database
Security – Integration with the Operating System - Privacy.

34

M.Tech. Network Security
MODULE VI COMMUNICATION AND WEB SECURITY 7

Protocol Design Principles - IP Security - IPsec and Network Address
Translation-SSL/TLS – Xtensible Authentication Protocol - Web Services
Security.

Total Hours: 45
REFERENCES:
1. David Solomon, “Foundations of Computer Security”, 1st Edition, Springer
Verlag, 2005.
2. Dieter Gollmann, “Computer Security”, Pearson education, 2010.
3. Charles P. Pfleeger, “Security in Computing”, 4th Edition, Prentice-Hall
International, 2006.
4. Christof Paar, Jan Pelzl, Bart Preneel, “Understanding Cryptography: A
Textbook for Students and Practitioners”, 1st Edition, Springer, 2010.
5. Bruce Schneider, “Applied Cryptography Protocols, Algorithms, and Source
Code in C”, 2nd Edition, John Wiley & Sons, 2007.

OUTCOMES:
Students who complete this course will be able to
• understand the concepts and foundations of computer security, and identify
vulnerabilities of IT systems.
• use basic security tools to enhance system security.
• develop basic security enhancements in stand-alone applications.

35

M.Tech. Network Security
CSB6101 RESEARCH METHODOLOGY FOR ENGINEERS L T P C
(Common to M.Tech (CSE, SE, NS, CPA, IT, IS & DF)) 3 1 0 4
OBJECTIVES:
• To make the students well versed in Data analysis.
• To describe the steps involved in research process.
• To explain them how to formalize research problems.
• To discuss clearly the approaches for research through some case studies.

MODULE I RESEARCH PROBLEM 8

The research problem – Sources of research problem – Information, how to
deal with it – Criteria / characteristics of a good research problem – Errors in
selecting a good research problem – Types of research – Nature and use of
arguments.

MODULE II SAMPLING DESIGN AND SCALING TECHNIQUES 7

Census and Sample survey – Steps in Sampling Design – Different types of
Sample Designs – Complex Random Sampling Designs – Measurement
scales – Techniques of Developing Measurement Tools – Scaling – Important
Scaling Techniques.

MODULE III METHODS OF DATA COLLECTION AND ANALYSIS OF DATA
8

Collection of Primary Data – different types – Some other methods of Data
Collection – Collection of Secondary Data – Processing Operations – Types
of Analysis – Measures of Central tendency – Measures of Dispersion.

MODULE IV LINEAR PROGRAMMING 10

Basic of Operations Research (OR): Characteristics of Operations Research
– OR and Decision making- Linear programming – Stimulation and Graphical
solution of canonical and standard forms of Linear programming problem –
Algebraic solution – Simplex method – Charne’s method of penalties – Concept
of duality – Properties of duality.

MODULE V TRANSPORTATION AND ASSIGNMENT MODELS 6

Transportation Problem – Assignment Problem – Travelling Salesman Problem.

36

M.Tech. Network Security
MODULE VI CASE STUDIES 6

Presentation by students on their area of research.

L-45; T-15; Total Hours: 60
REFERENCES:
1. Kothari, C.R., “Research Methodology: Methods and Techniques”, 2nd Edition,
New Age International, New Delhi, 2012.
2. Nicholas Walliman, “Your Research Project”, 2nd Edition, Vistaar Publication,
New Delhi, 2005.
3. Taha H.A., “Operations Research: An Introduction”, 7th Edition, Pearson
Education Edition, Asia, New Delhi, 2002.
4. Richard A. Johnson, “Miller and Freund’s Probability and Statistics for
Engineers”, 8th Edition, Pearson Education, Asia, 2011.

OUTCOMES:
Students who complete this course will be able to
• identify the research problem.
• become capable of analyzing the data.
• learn to apply the probability concepts in research.
• acquire a fundamental knowledge of linear programming and transportation
models.

37

38 . • Prepares students to work in the real world by applying networking concepts to solve real business problems. LIST OF EXERCISES : 1. “Detection and Response” How do we detect and respond to attacks? a) Preparing for and Detecting Attacks b) Digital Forensics OUTCOME: • The students will be able to identify the vulnerable attacks of Trojan threats and the detection and prevention of the attacks by means of digital forensics. Password Cracking Attacks 3. Key logging.M. hardening of computer systems. DOS and Trojan Attacks c) Escalating Privilege-Sniffing. “Networking Basics”. “Vulnerabilities and Threats”. how can networks be compromised? a) Scanning and Enumerating the Network for Targets b) Attacks-Web Server. and detection and incident response. “Prevention” How do we prevent Harm to Networks? a) Hardening the Host Computer b) Securing Network Communications 4. how do networks work? a) Workstation Network Configuration and Connectivity b) TCP/UDP Basics c) Network Applications 2. Email.Tech. Network Security CSB6143 COMPUTER SECURITY LAB L T P C 0 0 3 1 OBJECTIVES: • To identify the vulnerabilities.

MODULE I FOUNDATIONS OF DISTRIBUTED COMPUTING 8 What is distributed computing systems – Evolution of distributed computing systems – Distributed computing system models – What is distributed operating system – Issues in designing distributed operating systems-Message passing – Issues in IPC by message passing –Synchronization –Buffering – Group communication. Network Security SEMESTER II CSB6251 MODERN DISTRIBUTED NETWORK SYSTEMS L T P C 3 0 0 3 OBJECTIVES: • To gain knowledge on distributed communication. MODULE III DISTRIBUTED SHARED MEMORY AND FILE SYSTEMS 8 General architecture of DSM systems – Design & implementation issues of DSM – Granularity – Structure of shared memory space.M. 39 .Desirable features of good distributed file systems – File accessing models – File sharing– File caching schemes – Fault tolerance. • To understand the working functionality of remote procedure calls. • To acquire knowledge on resource utilization in distributed environment. • To study the network components and to get idea on network simulators.Tech. MODULE II REMOTE PROCEDURE CALLS 8 RPC Models –Transparency of RPC – Implementing RPC mechanism – Stub generation – RPC messages–Marshaling arguments & results – Server Management – Parameter-passing semantics – Call semantics – Communication protocols for RPCs. MODULE IV NETWORK & APPLICATION LAYER 7 Repeaters – Bridges – Routers – Gateway – Routing algorithms – TCP/IP – Overview – Network layer – Transport and application layers of TCP/IP – DNS – SMTP – HTTP – WWW.

Prentice Hall of India. Concepts & Design”. Behrouz and Forouzan. 2009. MODULE VI STUDY OF SIMULATION TOOLS 7 Study of various network simulators –Designing and evaluating the performance of various Transport and Routing protocols of Wireless networks using any network simulator. Pradeep K Sinha. 2007. Kasera and Seth.Tech. 2. 40 . Prentice Hall of India. 2nd Edition. Tata McGraw Hill. OUTCOMES: Students who complete this course will be able to • visualize the effectiveness of distributed environment. 2007. Network Security MODULE V ISDN & ATM 7 History of analog and digital network – Access to ISDN – ISDN layers – Broadband ISDN – Packet layer protocol – ATM – ATM architecture – ATM layers – Congestion control – Leaky bucket algorithm. Andrew. 4th Edition. “Data Communications and Networking”.Tenenbaum. 5. 2005. • acquire knowledge on modern networks which in turn helps him to design his own network using various network simulators. and Steen. Prentice Hall of India. “Computer Networks”. 2nd Edition. “Distributed Systems”. Maarten van. 6. 3. 2007. Andrew S. 2nd Edition. “Distributed Operating Systems. 4th Edition. “ATM Networks: Concepts and Protocols”. Morgan Kaufman Publishers. 4.S.Tanenbaum. Total Hours: 45 REFERENCES: 1. Larry L Peterson and Bruce S Davie. 2008. “Computer Networks: A Systems Approach”.M. Tata McGraw Hill.

Network Security CSB6252 APPLIED CRYPTOGRAPHY AND L T P C NETWORK SECURITY 3 0 0 3 OBJECTIVES: • To provide a practical survey of both the principles and practice of cryptography and network security.Applied cryptography in E-mail. network security tools and applications.Protocol Building blocks-Basic Protocols- Intermediate Protocols-Advanced Protocols-Esoteric Protocols. MODULE III SECURITY AND PRIVACY 8 Security and Privacy in Computing and Communication Networks-Preserving Authentication Protocols for Wireless Mesh Networks-Security from Location- Anonymous Authentication Protocols for Vehicular Ad Hoc Networks.Pseudo Random Sequence Generators and Stream Ciphers-one way hash function.Special algorithms for protocols. • To know the methods of conventional encryption.Tech.Identification schemes- Key Exchange algorithms. MODULE I CRYPTOGRAPHIC PROTOCOLS 7 Purpose of cryptographic protocols.M. Web services and Electronic commerce.Public key algorithms-Public key digital signature algorithms. MODULE V QUANTUM CRYPTOGRAPHY 7 Quantum Cryptography-Quantum Key Management-Securing a Telecom Services Using Quantum Cryptographic Mechanisms. MODULE IV NETWORK SECURITY 8 Secure Platform Over Wireless Sensor Networks-Privacy-Secure Digital Watermarking for Fair Content Trading-Lightweight Secure Data Communication Framework Using Authenticated Encryption in Wireless Sensor Networks-Key Establishment Protocol for Wireless Sensor Networks. system level security. concepts of public key encryption and number theory. 41 . • To understand authentication and Hash functions. MODULE II CRYPTOGRAPHIC TECHNIQUES AND ALGORITHMS 8 Key Length-Key Management-Algorithm Types and Modes-Data Encryption Standard-Other Block Ciphers-Combining Block Ciphers.

2012. John Wiley & Sons. 3.DNA Cryptography. 1st Edition. “Applied Cryptography Protocols. Algorithms. 2010. 42 .M. Information Science Reference. “Applied Cryptography for cyber security and Defense: Information Encryption and Ciphering”. Jaydip Sen. Total Hours: 45 REFERENCES: 1. 2nd Edition. Nemati & Liyang. OUTCOMES: Students who complete this course will be able to • understand the principles of encryption algorithms. Bruce Schneider. “Applied Cryptography and Network Security”. and Source Code in C”. InTech.Tech. 2. • have a detailed knowledge about authentication. Network Security MODULE VI EVOLUTIONARY CONCEPTS AND TECHNIQUES IN SECURITY 7 Notions of Chaotic Cryptography-Sketch of a Chaos Based Cryptosystem- Chaotic Electronic Circuits in Cryptography-An En/Decryption Machine Based on Statistical Physics-Modern Technologies Used for Security of Software Applications. conventional and public key cryptography. Hamid R. hash functions and application level security mechanisms. 2008.

Registry.Scientific method in forensic analysis .Duties Support Functions and Competencies.Network Forensics and Investigating logs – Investigating network Traffic .Forensic process . System logs) - Disk imaging . Cracking.Investigation Web attacks - Router Forensics.Searching and analysis - Investigative tools (Open Source and Proprietary) . networks and portable digital devices. MODULE VI CONTEXT.Programs and their traces . in a variety of digital forensic contexts. Scanning. Network Security CSB6253 DIGITAL AND CYBER FORENSICS L T P C 3 0 0 3 OBJECTIVE: • To enable students to understand issues associated with the nature of cybercrime.Investigating Cybercrime .Corporate Cyber Forensics .Legal process and law enforcement . MODULE I CYBER FORENSICS 9 Introduction to Cyber forensics .The digital crime scene .Email & Browsers. Memory.M.ACPO guidelines . detection methods and proof.Digital evidence .Information Security Investigations . Total Hours: 45 43 .Investigating large scale Data breach cases -Analyzing Malicious software. MODULE IV NETWORK FORENSICS 7 Investigating Network Intrusions and Cyber Crime . including computers. digital evidence. LEGAL AND PRACTICAL CONSIDERATIONS 5 Cybercrime . MODULE V COMPUTER FORENSICS 9 File Systems (File system organization.Tech.Incident response. MODULE II ETHICAL HACKING 6 Essential Terminology . MODULE III DIGITAL EVIDENCE IN CRIMINAL INVESTIGATIONS 9 The Analog and Digital World -Training and Education in digital evidence .Windows Hacking -Malware.

1st Edition. Elsevier Publication. “The Basics of Digital Forensics: The Primer for Getting Started in Digital Forensics”. • explain the nature of live forensics and network-based detection techniques. • describe the role of the file system in detecting and mapping user activity. 1st Edition. 3. Jan Pelzl. John J. 2011. H. “Computer Forensics: Investigating Network Intrusions and Cyber Crime”. 2. Barbara. 3rd Edition. EC-Council Press Series: Computer Forensics. EC – Council. Syngress. Syngress.Tech. “Handbook of Digital and Multimedia Forensic Evidence [Paperback]”. 1st Edition. Humana Press. • apply digital forensic examination techniques to support or oppose a hypothesis. “Digital Forensics with Open Source Tools”. 5. Heidelberg Springer. “Understanding Cryptography: A Textbook for Students and Practitioners”. Sammons. 2nd Edition. C & Carvey.M. Elsevier Publication. J. 44 . 2011.. 2010. Christof paar. OUTCOMES: Students who complete this course will be able to • list the varieties and describe impact of cybercrime. 2012. Altheide. 2011. • appreciate the need and nature of digital intelligence gathering and provide a write up of the conclusions. 4. Network Security REFERENCES: 1.

M.Physical access controls . • To master protocols for security services.CNSS security model .Tech.History of information security . MODULE V IMPLEMENTING INFORMATION SECURITY 7 Information security project management .What is security .Protocols for secure communications . NS)) 3 0 0 3 OBJECTIVES: • Understand what a security policy is and what the major mechanisms for implementing security policies are.Interception of Data .Information security planning and governance .Selecting a risk control strategy – Quantitative versus qualitative risk control practices. Network Security CSB6232 INFORMATION SECURITY L T P C (Common to M. MODULE IV PHYSICAL SECURITY 7 Introduction .Failure of supporting utilities and structural collapse .Components of an information system - Balancing information security and access .Positioning and staffing the security function. analyzed and dealt with.Tech (SE.Fire Security and safety .Need for security .Attacks on cryptosystems.Information security policy. MODULE III PLANNING FOR SECURITY 8 Introduction . 45 . standards and practices .Technical aspects of implementation . • To be familiar with how threats to an organization are discovered.Non technical aspects of implementation . MODULE I INTRODUCTION TO INFORMATION SECURITY 8 Introduction .System development life cycle - Security systems development life cycle – Threats –Attacks .Risk identification – Assessment .Control strategies .Secure software development.Cryptographic tools . MODULE II RISK MANAGEMENT 7 Introduction .Remote computing security.

“Principles of Information Security”.M. Elsevier Publications. “The Basics of Information Security”. 46 . James Michael Stewart. 1st Edition. • understand authentication protocols and processes.Tech. OUTCOMES: Students who complete this course will be able to • identify the major types of threats to information security and the associated attacks. Jason Andress. 2011. standards and practices. 3. 2007. Pearson Education India. 2nd Edition. Merkow. Total Hours: 45 REFERENCES: 1. 2011. • understand the role of management in enforcing security policies. • know how authentication is implemented in wireless systems. Network Security MODULE VI SOCIAL AND HUMAN ELEMENTS OF INFORMATION SECURITY 8 Human and Social Aspects of Password Authentication .Social and Human Elements of Information Security: A Case Study-Security Configuration for Non-Experts: A Case Study in Wireless Network Configuration. “Information Security: Principles and Practices”. Syngress Press. Ed Tittel and Mike Chapple.Impact of the Human Element on Information Security . 3rd Edition. John Wiley & Sons. 2.

RSA signature. and understanding of authentication protocols. OUTCOMES: Students who complete this course will be able to • know the data encryption and working of the encryption algorithms. Encryption key (e. Network Security CSB6254 CRYPTOGRAPHY LAB L T P C 0 0 3 1 OBJECTIVE: • The aim of the lab is to provide some experience with cryptanalysis of historic ciphers. 10. Short Message RSA attacks and Padding. Generate Digital signature using Hash code / MAC code. 47 . n) & (d.M. 6. 4. Implement RSA asymmetric (public key and private key)-Encryption. Attack on Digital signature/ Hash collision. Implementation of S-DES algorithm for data encryption. Write program for Mono alphabetic cipher. Writing a simple certificate Authority. 2. n). working with modern encryption algorithms. 9. 3. • understand the authenticity measures. List of Experiments 1. Encryption using classical techniques / binary/byte addition / binary/byte addition. 8. 5.Tech. Hash generation and sensitivity of hash functions to plaintext modifications. 7.

M. • Preparation of case study design document. Methodology of Assessment • The class can be grouped as teams of not more than three in a team.Tech. Operating system security • Legal and ethical issues in information systems security. • Each team should prepare and deliver a presentation on the contents of the documents such as the SRS and Design document. OUTCOMES: Students who complete this course will be able to • identify information security threats for various practical applications. • To study the cryptographic tools . Case study topics may be selected as per the choice of the students and the Case study may be evaluated on the following parameters • Problem description and Analysis. authentication and legal issues in security. • understand the security policies and usage of cryptographic tools for various applications. Network Security CSB6255 INFORMATION SECURITY (CASE STUDY) L T P C 0 0 3 1 OBJECTIVES: • To understand the basic principles and practices in information systems security. 48 . Access control • Software Security . • Communication and clarity of presentation. Case Study Topics • Information security concepts • Common attacking techniques • Common security policies • Basic cryptographic tools • Authentication. • Each team can present their observations based on the parameters given.

Impact of technological change on human life –Technology and responsibility – Technology and social justice. • To make them realize the need of sustainability in the context of emerging technologies. • To introduce students a broad range of perspectives on the adoption and use of technologies.Co- evolution of technology and economy – Scientific knowledge and technological advance – Science and Engineering aspects of Technology – Impact on the Society – Social and Ethical Issues associated with technological change – Social and environmental consequences . MODULE II TECHNOLOGY AND ITS ADVANCEMENT 9 Sociological aspects of technology – Ethics and technology – Technology and responsibility – International Economics. Energy and Environment – Organisations and technological change MODULE III SOCIETY AND TECHNOLOGY 9 Impact of technologies on contemporary society – Role of society in fostering the development of technology – Response to the adaption and use of technology – Impact of technology on developer and consumers – Technological change and globalisation. • To make them realise the profound impact on society. Globalisation and Human Rights – Sustainability and Technology – Population and environment .M. Network Security SEMESTER III SSB7181 SOCIETY.Innovation – Historical Perspective of technology – Sources of technological change .Technology. TECHNOLOGY AND SUSTAINABILITY L T P C 3 0 0 3 OBJECTIVES: • Aware of new technologies through advances in Science and Engineering. • Understand the ethical issues raised by technological changes and its effect on society. 49 .Tech. MODULE I TECHNOLOGY AND ITS IMPACTS 9 Origin and evolution of technologies – Nature of technology.

Volti Rudi. “Society and Technology Change”. “Sustainability Science and Engineering: Defining Principles”.Menon. 2. 2005. Winston M and Edelbach R. 3. USA. “The nature of Technology: What it is and how it evolves”. USA.M. • connect sustainability concepts and technology to the real world challenges. 2011. • find pathway for sustainable society. OUTCOMES: At the end of this course. Worth publishers Inc. Free Press.A Abraham. San Francisco. Pearson Education. Arthur W. 6th Edition. NY. 3rd Edition. the students will be able to • understand the benefits of modern technology for the well-being of human life. USA. 2009. “Society. Elsevier Inc.sustainable manufacturing- Green consumer movements – Environmental ethics – Sustainability of the planet Earth – Future planning for sustainability. R. 4.sustainable design. 50 .A. MODULE V THE IMPORTANCE OF SUSTAINABILITY 9 Sustainability – A brief history – Concepts and contexts for sustainability – Ecological imbalance and biodiversity loss – Climate change – Population explosion.G. 2006.Tech. Ethics and Technology”. Network Security MODULE IV IMPACT OF A SPECIFIC TECHNOLOGY ON HUMAN WELFARE 9 Impact of the following technologies on Human life – Medical and Biomedical – Genetics Technology – Electronics and Communications – Electronic media Technology – Information Systems Technology – Nanotechnology – Space Technology and Energy Technology. 5. “Technology and Society”. Total Hours : 45 REFERENCES: 1. India. USA.V. Martin A. 2009. Industrial ecology – systems approach to sustainability – Green engineering and technology.

Tech.Application Software Packages.CSE.Constructing the Project Network Diagram - Effective Project Proposal .Tech(NS.Fundamentals of Project Management . MODULE IV ESTABLISHING PROJECT MANAGEMENT LIFE CYCLES 7 Understanding the Complexity/Uncertainty . MODULE II PROJECT MANAGEMENT PROCESS GROUPS 8 Defining the Five Process Groups . Templates. Network Security CSB7201 SOFTWARE PROJECT MANAGEMENT L T P C (Common to M. • To discuss the various aspects of project management. 51 .Sequence of Activities – Complex Activities – A Business focused definition .Using Tools. CPA . and Processes to Plan a Project .SE)) 3 0 0 3 OBJECTIVES: • To define and highlight importance of software project management.Adaptive Project Management Life Cycle – Adapting and Integrating the APM Toolkit.Nine Knowledge Areas .Managing the Creeps .Project Planning Tools – Planning and Conducting Joint Project - Building the WBS .Managing Client Expectations .Choosing the Best-Fit PMLC Model -Internet protocols-Ethernet-Wi-Fi-Bluetooth-ATM. MODULE III TPM PROJECT 8 Using Tools.Importance of Classifying Projects .Launch a TPM Project.Agile Project Management - Iterative Project Management Life Cycle.Mapping Knowledge Areas to Process Groups .Introducing Project Management Life Cycles .Understanding the Scope Triangle . MODULE I FUNDAMENTALS OF PROJECT MANAGEMENT 8 Defining a project. • To understand the tasks in software project management.Estimating . Templates.Traditional Project Management - Incremental Project Management Life Cycle . and Processes to Scope a Project .M.Monitor and Control a TPM Project. • To study and describe the project management life cycles.

“Effective Project Management – Traditional. Robert K. Network Security MODULE V BUILDING AN EFFECTIVE PROJECT MANAGEMENT 7 Establishing and Managing a Project Portfolio Management Process . “Effective Software Project Management”. Wiley Publication. • acquire the ability to track project execution. Robert K. 6th Edition.M.Using Process Improvement Tools.Using Tools. 2. Total Hours: 45 REFERENCES: 1. Extreme”. 3rd Edition.Tech. MODULE VI MANAGING THE REALITIES OF PROJECTS 7 Prevention and Intervention Strategies for Distressed Projects . Wysocki.Establishing and Managing a Continuous Process Improvement Program . and Processes to Prevent Distressed Projects .Managing the Professional Development of Project Teams. 52 .De?ning Process and Practice Maturity . Wiley Publication. 2011. • understand the impact of uncertainty and complexity in project management. Templates and Processes. 2010. OUTCOMES: Students who complete this course will be able to • develop a project management plan. Wysocki.Organizing Multiple Team Projects .The Project Portfolio Management Life Cycle . Templates. Agile.

M. evaluation. Network Security LIST OF ELECTIVES CSBY51 INTRUSION DETECTION L T P C 3 0 0 3 OBJECTIVES: • To provide detailed and concise information on different types of attacks.Routing attacks-Detection approaches-Data collection. MODULE III CORRELATION ANALYSIS OF INTRUSION ALERT 8 Introduction . implementation. prerequisites and consequences of attacks.Approaches based on similarity between Alert Attributes. MODULE I INTRODUCTION 9 Introduction .Intrusion detection and prevention basics – Network Attacks- Attack taxonomies-Probes-Privelege Escalation attacks-DDoS attacks-Worms Attacks . MODULE IV NETWORK ATTACKS 7 Introduction-Preliminaries-Hardening Network to prevent multistep attacks- Response: building the link between intrusion detection alerts and security policies-problem statement-Security policy formalism-Applying Or-BAC for thread response-The threats response system-From alerts to new policies.Tech. and intrusion response. multiple information sources .Privacy issues in Alert correlation. data collection. 53 . • To provide an overview of some of the commercially/publicly available intrusion detection and response systems. MODULE V INTRUSION DETECTION AND REACTION 7 Introduction-Related work-Proposed framework-An Architecture for intrusion detection-Intrusion reaction: a system for attack source detection-Conclusions and future work. predefined attack scenarios. theoretical foundation of attack detection approaches. MODULE II THEORETICAL FOUNDATIONS OF DETECTION 9 Taxonomy of Anomaly Detection system-fuzzy logic – Bayes theory – Artificial Neural networks – Support vector machine – Evolutionary computation – Association rules – Clustering-Signal processing techniques based models- Comparative study of anomaly Detection techniques.

Paul E. “The Practical Intrusion Detection Handbook”. 2006. related case studies and much more. Jim Mellander. 1st Edition. 54 . and firewalls. Total Hours: 45 REFERENCES: 1.Tech. Jonathan Hogue.Snorts Intrusion Detection – NFR security. McGraw Hill. Pearson Education.Cisco Security IDS . 2001. • gain knowledge on defense alert systems against computer and network attacks. OUTCOMES: Students who complete this course will be able to • learn how to defend against computer and network attacks. “Intrusion Prevention Fundamentals”. 2007. complementary security devices such as intrusion detection systems (IDSs). “Intrusion detection and Prevention”. Prentice Hall. 2. 2nd Edition. Eugene Schultz. Ltd. “Intrusiion Alert”. Carl Enrolf. 2004. multiple. Earl Carter.M. 1st Edition. integrating intrusion alerts within security policy framework for intrusion response. Proctor. 1st Edition. 3.Bro Intrusion Detection – Prelude Intrusion Detection .. Network Security MODULE VI APPLICATIONS AND TOOLS 5 Tool Selection and Acquisition Process . Ankit Fadia and Mnu Zacharia. Vikas Publishing house Pvt. 4.

Total Hours: 45 55 . • To provide the base for rational decision making.Tech. MODULE V COOPERATIVE GAMES 8 Coalitions and Characteristic Functions – Finding the least core – The Nucleolus – The Shapley value – Bargaining – The Nash model with security point – Threats – Problems. MODULE VI EVOLUTION AND APPLICATIONS 5 Evolutionary Stable Strategies and Population games – Problems – Applications. MODULE I INTRODUCTION 8 Matrix – person games – The von Neumann Minimax Theorem – Mixed strategies – Dominated Strategies – Solving 2 x 2 games graphically – Graphical solution of 2 x m and n x 2 games – Problems.M. MODULE III TWO PERSON NONZERO SUM GAMES 8 Basics – 2 x 2 Bimatrix Games – Interior Mixed Nash Points by Calculus – Nonlinear Programming Method – Choosing among several Nash Equilibria – Problems. • To play an important role in logic and computer science. MODULE II SOLUTION METHODS FOR MATRIX GAMES 8 2 x 2 games – Invertible matrix games – Symmetric games – A direct formulation without transforming – Linear Programming – Simplex Method – A Game Theory Model of Economic Growth. Network Security CSBY52 GAME THEORY AND ITS APPLICATIONS L T P C 3 0 0 3 OBJECTIVES: • To provide a theoretical basis to the field of multi-agent systems. MODULE IV N PERSON NONZERO SUM GAMES 8 Economics applications of Nash equilibria – Duels – Auctions – Complete Information – Incomplete Information – Symmetric Independent Private Value Auctions – Symmetric Individual private value auctions – Problems.

1st Edition. “Introduction to Game Theory in Business and Economics”. 2013. • construct game theoretic models in applied fields. Bezalel Peleg. 4. Thomas J Webster. 2nd Edition. “Game Theory: An Introduction”. “Game Theory: An Introduction”. 3. Segment Books. 2009.Tech.”Introduction to the Theory of Cooperative Games”. Princeton University Press. Steven Tadelis. N. Wiley India Pvt Ltd. 2nd Edition. OUTCOMES: Students who complete this course will be able to • solve more advanced and interesting games without spending time on the theory of linear programming.M. E. Peter Sudholter. Network Security REFERENCES: 1. 56 . 2010. Barron. 2012. 2. 2nd Edition. Springer.

MODULE IV QUEUEING MODELS 7 Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s formula – Machine Interference Model – Steady State analysis – Self Service Queue – Network Optimal Path. MODULE I LINEAR PROGRAMMING 8 Formulation – Graphical solution – Simplex method – Two phase method – Transportation and Assignment Problems. MODULE V SIMULATION 7 Discrete Event Simulation – Monte-Carlo Simulation – Stochastic Simulation – Applications to Queuing systems. • To gain the knowledge of simulation and non-linear programming of scheduling algorithms.Tech. • To study the concept of queuing models and advanced queuing models which provides models for a number of situations that arise in real life. 57 .M. MODULE III INVENTORY MODELS 8 Inventory models – Deterministic models – Production models – Economic ordering quantity – Buffers stock – Shortage and quantity discount – Probabilistic inventory model – EOQ and safety stock calculation. transportation and assignment problems. Network Security MAB 6194 OPERATIONS RESEARCH L T P C 3 0 0 3 OBJECTIVES: • To teach about linear programming techniques. MODULE II SCHEDULING BY PERT AND CPM 8 Network Construction – Critical Path Method – Project Evaluation and Review Technique – Resource Analysis in Network Scheduling.

• gain the knowledge of linear programming techniques.. 58 . Academic Press. Pearson Education Edition.K. Thomson – Brooks/Cole.M. OUTCOMES: Students who complete this course will be able to • use various queuing models. H. • apply simulation to various situations and scheduling techniques. Taha. 3rd Edition.Tech. Sharma J. “Operations Research: An Introduction”.. “Operations Research: Theory and Applications”. Macmillan India Ltd. 9th Edition. T.. 5. New Delhi.L. 2. ‘Operations Research’. Asia.A.G. Springer. Winston. 4th Edition. 3. 2002. 2nd Edition. Robertazzi. transportation and assignment problems. 2006. Ross.. Network Security MODULE VI NON-LINEAR PROGRAMMING 7 Lagrange multipliers – Equality constraints – Inequality constraints – KuhnTucker conditions – Quadratic Programming. “Probability Models for Computer Science”. 2002. 3rd Edition. 2003. “Computer Networks and Systems – Queuing Theory and Performance Evaluation”..W. 4. 2002 Reprint. Total Hours: 45 REFERENCES: 1.M. S.

and confidentiality – PKI enabled Services. MODULE IV CONTENTS OF A SET OF PROVISIONS 8 Introduction – Publication and Repository Responsibilities – Identification and Authentication (I&A) – Certificate Life – Cycle Operational Requirements – Facility. • To study advanced security issues and technologies.Tech.M.509 – PKIX – X. • To be familiar with network security designs using available secure solutions. MODULE III PKI STANDARDS 6 General PKIX standardization Requirements – X. and Operational Controls – Technical Security Controls. Network Security CSBY53 PUBLIC KEY INFRASTRUCTURE AND L T P C KEY MANAGEMENT 3 0 0 3 OBJECTIVES: • To provide high level understanding of how information security is used in an organization. Integrity. MODULE VI CRYPTOGRAPHIC APPLICATIONS 7 Cryptography on: Internet–Wireless local area networks – Mobile 59 . MODULE V PUBLIC KEY MANAGEMENT 8 Key Management fundamentals – Certification of public keys – Certificate life cycle – Key pair changes – Public key certificate management models – Alternate approaches. MODULE II SECURITY ISSUES 8 Certificate and Certification – Key and Certificate Management – Certificate revocation – Trust models – PKI operational Considerations – Electronic Legislation and Considerations.500 – LDAP – S/MIME – IPSec – TLS – SPKI – Open PGP EDIF ACT. Management. MODULE I INTRODUCTION 8 Basic security concepts – Public key cryptography – Concept of an Infrastructure – Core PKI services: Authentication.

“Everyday Cryptography: Fundamental Principles and Applications”.M. Auerbach Publications. Vacca. Carlisle Adams. 3. • describe how security is implemented in a Web environment. OUTCOMES: Students who complete this course will be able to • design and create a certificate template. 2003. “Public Key Infrastructure: Building Trusted Applications and Web Services”. 2nd Edition. 2012. 60 . and Deployment Considerations”.Tech. 1st Edition. Steve. Total Hours: 45 REFERENCES: 1. Oxford University press. 2004. Pearson Education. 2. “Understanding PKI: Concepts. Keith M. John R. Network Security telecommunications– Security payment card transactions – Video broadcasting – Identity cards – Home users. Martin. • perform certificate management tasks. Lloyd. Standards.

• To identify the different security issues in wireless networks. GPRS . MODULE II WIRELESS WANS 8 First Generation Analog. Physical Layer. Security and Privacy. • To gain knowledge about various wireless LAN and WAN concepts. Network Security CSBY54 MOBILE AND WIRELESS NETWORK SECURITY L T P C 3 0 0 3 OBJECTIVES: • To learn physical as wireless MAC layer alternatives techniques.Fourth Generation Systems (OFDM).Classification. Table-driven and Source-initiated On Demand routing protocols. Hybrid protocols. MAC and Routing protocols. Short Messaging Service in GSM. HIPERLAN. • To learn security issues in wireless networks.11 standards.Tech. Wireless Sensor networks. Wi-Max standard.Third Generation Systems (WCDMA/CDMA 2000) . MODULE I MULTIPLE RADIO ACCESS 7 Medium Access Alternatives: Fixed-Assignment for Voice Oriented Networks Random Access for Data Oriented Networks. • To understand planning and operation of wireless networks. Second Generation TDMA – GSM. Physical and MAC layer details. Standards – Standard Introduction to PANs – Commercial Alternatives to PANs.IEEE 802.11 WLAN – Architecture and Services.MAC Management Sub layer. MODULE V WIRELESS MANS AND PANS 8 Wireless MANs – Physical and MAC layer details.MAC sub layer. 61 . Other IEEE 802. MODULE III WIRELESS LANS 7 Introduction to wireless LANs . Wireless PANs – Architecture of Bluetooth Systems. Second Generation CDMA – IS-95.M. Handoff and Roaming Support. MODULE IV ADHOC AND SENSOR NETWORKS 7 Characteristics of MANETs.

1st Edition. Network Security MODULE VI SECURITY IN WIRELESS NETWORKS 8 The need for wireless security – Attacks on Wireless Networks – Security Services – Wired Equivalent Privacy (WEP) Protocol – Mobile IP – Weakness in the WEP Scheme –Virtual Private Network. Rogers & John Edwards.E. 2007. 62 . 2nd Edition. 6. Dharma Prakash Agrawal & Qing-An Zeng. John Wiley & Sons Ltd. & Daniel Collins. 5. Pomportsis. 4. 1st Edition. 2007. 2007. Total Hours: 45 REFERENCES: 1. S. K. “Wireless Networks”. Gary. OUTCOMES: Students who complete this course will be able to • understand basic operation of a cellular network. WAN. Garg. “Wireless Communication and Networking”. PAN. Thomson India Edition.Tech. 2003. P.M. 2. 2nd Edition. “3G Wireless Networks”. Tata McGraw Hill. 2nd Edition. “An Introduction to Wireless Technology”.. “Introduction to Wireless and Mobile Systems”. Papadimitriou. Morgan Kaufmann Publishers. Vijay. 2007. • understand basic operations of wireless LAN. William Stallings. Pearson / Prentice Hall of India. • comprehend different generation of wireless networks. 3. 1st Edition. Clint Smith. 2007. Andreas S. "Wireless Communications and networks”. Georgios I. Pearson Education.

Web 2.Advantages of e-commerce.E-check-Micropayment system. • To study Internet computing technologies in detail. MODULE II BASIC TECHNOLOGIES OF ECOMMERCE 8 E-Commerce infrastructure-Client side Programming. e-business Requirements.Internet Security.E- cash. MODULE I INTRODUCTION 6 Electronic commerce and Physical Commerce.Different type of ecommerce- some e-commerce scenario.Characteristics of e-Business. impacts of e-business. MODULE VI E-BUSINESS INTRODUCTION 8 E-Business Vs E-commerce . REST Web Services.Sales and Promotions. MODULE III ADVANCE TECHNOLOGIES OF E-COMMERCE 8 Mobile Agent.0. MODULE IV INTERNET PAYMENT SYSTEM 7 Characteristics of payment system. Total Hours: 45 63 . MODULE V E-COMMERCE STRATEGIES 8 Strategies for marketing.M.Tech.Rich Internet Application.WAP.Data Mining.session tracking techniques. Server Side Programming-Database connectivity.E-Business role and their challenges.Web Mash up.SET Protocol for credit card payment.Working of Search Engines.XML. Network Security CSBY55 TECHNICAL FOUNDATION OF E-COMMERCE L T P C 3 0 0 3 OBJECTIVES: • To study technical aspects of Internet Commerce/ Web-based Electronic Business.Strategies for Purchasing and support activities-Strategies for Web Auctions-Virtual Communities and web portals.

Raymond Lee. Henry Chan. Miami University. 64 . Oxford.M. Elizabeth Chang . Tharam Dillon. John Wiley & Sons. Ohio John Benamati OhioI . William S. 2007. 2. 1st Edition.Tech. OUTCOMES: Students who complete this course will be able to • gain knowledge on the important computing technologies. Davis Miami University. Oxford. Fundamentals And Applications”. • learn how to integrate these technologies to build a useful application.1st Edition.2002. Network Security REFERENCES: 1. “E- Commerce Basics: Technology Foundations and E-Business Applications” . “E-Commerce.

PC/network access. MODULE I INTRODUCTION 7 Biometric fundamentals – Biometric technologies – Biometrics Vs traditional techniques – Characteristics of a good biometric system – Benefits of biometrics – Key biometric processes: verification. strengths and weaknesses – Automated fingerprint identification systems. identification and biometric matching – Performance measures in biometric systems: FAR. working principles. 65 . MODULE IV BIOMETRIC APPLICATIONS 8 Categorizing biometric applications – Application areas: criminal and citizen identification. MODULE II PHYSIOLOGICAL BIOMETRICS 9 Leading technologies : Finger-scan – Facial-scan – Iris-scan – Voice-scan – Components. strengths and weaknesses – Other physiological biometrics : Hand-scan.Tech. surveillance.M. working principles. FRR. Network Security CSBY56 BIOMETRIC SECURITY L T P C 3 0 0 3 OBJECTIVES: The objective of this course is: • To enable the students to understand the fundamentals of biometric security. Retina-scan – Components. competing technologies. MODULE III BEHAVIOURAL BIOMETRICS 7 Leading technologies: Signature-scan – Keystroke scan – Components. FTE rate. e-commerce and retail/ATM – Costs to deploy – Other issues in deployment. strengths and weaknesses. competing technologies. working principles. EER and ATV rate. MODULE V PRIVACY AND STANDARDS IN BIOMETRICS 7 Assessing the Privacy Risks of Biometrics – Designing Privacy-Sympathetic Biometric Systems – Need for standards – Different biometric standards. • To develop the skills of the students with this technology for improving security and trust in different fields of modern society.

retina.” Biometrics for Network Security”. 3. Paul Reid. Pearson Education.1st Edition. Samir Nanavathi. 4. palm print. and other modalities. iris. Wiley Eastern Publications. Total Hours: 45 REFERENCES: 1. 1st Edition. “Biometrics -Identity verification in a network”. Network Security MODULE VI BIOMETRIC TRANSACTION 7 Securing and trusting a Biometric Transaction – User – Biometric Reader – Trusted Biometric Devices – Non Trusted Biometric Devices . 2. 66 . John Berger. 1st Edition.” Implementing Biometric Security”. and Raj Nanavathi. Michel Thieme.Tech. Wiley Eastern. 2003. OUTCOME: Students who complete this course will be able to • understand the design of various biometric systems based on fingerprints. “Biometrics for Network Security “. 2008. Prentice Hall.M. 2004. John Chirillo and Scott Blaul. 1st Edition.Matching Location – Local host – Authentication Server – Match on Card (MOC). face. 2002.

Network Security CSBY02 SOFT COMPUTING L T P C (Common to M. MODULE I NEURO FUZZY AND SOFT COMPUTING 7 Soft computing constituents and Conventional Artificial Intelligence . fuzzy logic and use of heuristics based on human experience. intersection and complement .Neuro fuzzy and soft computing characteristics .Fuzzy sets .M.Introduction to Classical Sets and Fuzzy sets – Classical Relations and Fuzzy Relations – Tolerance and Equivalence Relations –Membership Functions: Fuzzification – Methods of Membership Value Assignments – Defuzzification – Lambda-Cuts for Fuzzy sets and Fuzzy Relations – Defuzzification Methods.Tech (CSE.Basic definitions - Fuzzy union.Fundamental concept – Evolution of Neural Networks – Basic Models of Artificial Neural Networks – Important Terminologies of ANNs – McCulloch-Pitts Neuron – Supervised Learning Network: – Multiple Adaptive Linear Neurons – Back-Propagation Network – Radial Basis Function Network. • To understand the concepts of Genetic algorithm and its applications. MODULE II ARTIFICIAL NEURAL NETWORK 7 Introduction – Machine Learning Basics . • To introduce new ideas of neural networks. MODULE III ARTIFICIAL NEURAL NETWORK.II 7 Associative Memory Networks: Training Algorithms for Pattern Association – Auto associative Memory Network – Hetero associative Memory Network – Bidirectional Associative Memory – Hopfield Networks – Iterative Auto associative Memory Networks – Temporal Associative Memory Network. NS)) 3 0 0 3 OBJECTIVES: • To learn soft computing algorithms.Tech. Unsupervised Learning Networks: Fixed weight Competitive Nets – Kohonen Self-Organizing Feature Maps – Learning Vector Quantization – Counter propagation Networks – Adaptive Resonance Theory Networks – Special Networks. SE . 67 .

Jang. Applications.M. 2003. Sumathi and S. Deepa. 2007. 2008.R. “Neural Networks Algorithms. 1st Edition. 2003. Pearson Edition. S. “Introduction to Fuzzy Logic using MATLAB”.Extensions and Advanced Topics. S.Mizutani. “Neural Networks and Learning Machines”..S. 2. “Principles of Soft Computing”. 5. Wiley India.N. Simon O Haykin.T. N. 6. Springer. 2nd Edition.Sun and E. J.V. and Programming Techniques”. PHI.ANFIS as a Universal Approximator . “Neural Networks. 3rd Edition.Simulation Examples . 8th Edition. S. 68 . Skapura.Hybrid Learning Algorithm . N. Rajasekaran and G. “Neuro-Fuzzy and Soft Computing”. MODULE VI APPLICATIONS OF SOFT COMPUTING 8 A Fusion Approach of Multispectral Images with SAR Image for Flood Area Analysis – Optimization of Travelling Salesman Problem using Genetic Algorithm Approach – Genetic Algorithm based Internet Search Technique – Soft Computing based Hybrid Fuzzy Controllers – Soft Computing based Rocket Engine – Control.N. C. Fuzzy Logic and Genetic Algorithms”. Sivanandan and S. James A. 2004. 1st Edition. Genetic Algorithm – Simple GA – General Genetic Algorithm – The Scheme Theorem – Classification of Genetic Algorithm – Holland Classifier Systems – Genetic Programming.Pai. Total Hours: 45 REFERENCES: 1. Sivanandam. 2007.Tech. 4.Learning Methods that Cross- fertilize ANFIS and RBFN .A. S. Deepa. 1st Edition. Network Security MODULE IV GENETIC ALGORITHM 8 Introduction – Basic Operators and Terminologies in GAs – Traditional Algorithm vs. MODULE V NEURO FUZZY MODELING 8 ANFIS Architecture . PHI. Pearson Higher Education. 3. Freeman and David M.

Tech. 69 . • develop an application using various soft computing algorithms. • solve various real world problems using soft computing algorithms. Network Security OUTCOMES: Students who complete this course will be able to • obtain the theoretical and practical knowledge for design and development of basic intelligent systems.M.

Timer and Clock Services – Memory Management Issues.Tech (CSE.Tech.Program Modeling Concepts.M. Simulation and Debugging . Network Security CSBY08 EMBEDDED SYSTEMS L T P C (Common to M. • To expose to the embedded programming concepts and study the procedures for development and testing. COMMUNICATION BUSES AND PROTOCOLS 8 I/O Devices – Device I/O Types and Examples – Synchronous Communication – ISO-Synchronous Communication – Asynchronous Communication – Serial Bus Communication Protocols – Parallel Bus Communication Protocols– Wireless and Mobile System Protocols. MODULE II REAL-TIME OPERATING SYSTEMS 8 Overview – Pseudo kernels to Operating Systems – Scheduling Fundamentals – System Services: Buffers . MODULE III DEVICES. MODULE V DEVELOPMENT AND TESTING 8 Embedded Software Development Process . SE. 70 . MODULE I INTRODUCTION TO EMBEDDED SYSTEMS 6 Definitions – Embedded hardware components – Embedded Software – System on Chip (SoC) – VLSI Circuits – Fundamentals of Embedded System Design.Design Examples and Case Studies of Program Modeling and Programming with RTOS. • To understand the various building components of an embedded system.Priority Inversion .Development Tools – Hardware and Software Design Issues – Techniques and Tools for Testing. NS)) 3 0 0 3 OBJECTIVES: • To provide basic understanding about embedded systems.Mailboxes – Semaphores – Deadlock and Starvation Problems. MODULE IV EMBEDDED PROGRAMMING CONCEPTS 8 Assembly Language Programming Vs High Level Programming – Embedded C Programming Elements and Fundamentals – Object Oriented Programming for Embedded Systems – Cross Compliers – Memory Footprint optimization .

2009. Total Hours: 45 REFERENCES: 1. 3. Ovaska.Fault Tolerance – Inherent Uncertainly – Performance optimization Techniques. 2009.Tech. • understand the embedded programming concepts. 2nd Edition. Wiley-IEEE Press. Programming and Design”. • analyze a real time scenario. “Embedded Systems: Architecture. 2011. 1st Edition. 2. 4th Edition.Analysis of Memory Requirements – Metrics . “Embedded Software Development with C”. design an embedded system and analyze its performance.M. Laplante. “Real-Time Systems Design and Analysis: Tools for the Practitioner”. 71 . Network Security MODULE VI PERFORMANCE ANALYSIS OF EMBEDDED SYSTEMS 7 Real Time Performance Analysis – Applications of Queuing Theory – Input/ output Performance . Seppo J. Kai Qian. Phillip A. McGraw-Hill Education. Raj Kamal. India. OUTCOMES: Students who complete this course will be able to • possess the basic understanding of embedded system and its building blocks. Li Cao. David Den Haring. Springer.

The Bottom Line .Cloud Lock-in .Control over Security in the Cloud Model - Making Sense of Cloud Deployment . Perception of Risk and Cloud Computing .Real- world Cloud Usage Scenarios.Cloud Data Security: Sensitive Data Categorization .Effectively Managing Risk .Assessing Your Risk Tolerance in Cloud Computing .Data Encryption: Applications and Limits . • will provide a consistent way of developing cloud security competency.Security Requirements for the Architecture . MODULE III SECURING THE CLOUD: ARCHITECTURE 8 Cloud Computing: Security Concerns .An Historical View: roots of Cloud Computing .Legal and Regulatory Issues .Security Patterns and Architectural Elements .Cloud Reference Architecture .The Limits of Security Controls .Understanding Cloud Computing -The IT Foundation for Cloud . 72 .M.Cloud Security Architecture .A Brief Primer on Architecture . • provide the knowledge and confidence to build/adopt secure cloud solutions. MODULE I INTRODUCTION TO CLOUD COMPUTING AND SECURITY 7 Terminology .Tech.Cloud Data Storage .A Brief Primer on Security .Risk.Security Monitoring. MODULE IV DATA SECURITY 8 Overview of Data Security in Cloud Computing .Making Sense of Services Models - Cloud Formation and Key Examples .Security Architecture. Network Security CSBY57 SECURITY ISSUES IN CLOUD COMPUTING L T P C 3 0 0 3 OBJECTIVES: This course • will introduce the students to the world of cloud computing security.Overview of Security Controls .Introduction to Cloud Computing and Security .Planning Key Strategies for Secure Operation. MODULE II CLOUD COMPUTING ARCHITECTURE 6 Cloud Reference Architecture .

From Architecture to Efficient and Secure Operations . Hamid Nemati.Selecting a CSP: Security Criteria. • explain cloud computing security controls recommendation. 2011. Network Security MODULE V BUILDING AN INTERNAL CLOUD 8 Private Clouds: Motivation and Overview . 2010.Selecting a CSP: Overview of Risks . IGI Global. OUTCOMES: Students who complete this course will be able to • understand Cloud Computing Architectural Framework.1st Edition. 2012. Russell Dean Vines.Checklists for Evaluating Cloud Security . Winkler. MODULE VI AN INFORMATION SECURITY FRAMEWORK 8 Evaluating Cloud Security .M. Krutz.Selecting a CSP: Overview of Assurance .Security Operations Activities. Total Hours: 45 REFERENCES: 1. Wiley Publications.Security Criteria for Ensuring a Private Cloud .1st Edition. 1st Edition. “Securing the Cloud: Cloud Computer Security Techniques and Tactics”. Elsevier Syngress. 3. 73 .R.Tech. “Cloud Security: A Comprehensive Guide to Secure Cloud Computing”. • point out Cloud Computing Security challenges. 2. Vic J. Ronald L. • develop an information security framework. “Optimizing Information Security and Advancing Privacy Assurance”.

• To introduce how to build the Service Oriented Architecture with web services. • To introduce the importance of service orientation and web services.Service Modeling of Service Oriented Analysis.Service interface design tools .Correlation and Policies . positioning core SOA standards and choosing SOA extension .Web service extension. MODULE I INTRODUCTION 7 Basic definition .The extension of SOA .Service Oriented Analysis Introduction .Steps to composing SOA .Tech (CSE.Tech.Planning and Analysis .Characteristics and misperceptions about SOA -Benefits and pitfalls of SOA.Security- Notification and Eventing. NS)) 3 0 0 3 OBJECTIVES: • To introduce the concept of Service Oriented Architecture. MODULE V SERVICE ORIENTED DESIGN 8 Introduction to service oriented design . Network Security CSBY24 SERVICE ORIENTED ARCHITECTURE L T P C (Common to M.Web service and primitive SOA .Fundamentals of SOA .M.Atomic Transaction . SE .SOA delivery strategies .Service Activity – Coordination . MODULE VI WEB SERVICE EXTENSION AND SOA PLATFORM 8 WS Addressing language Basics . MODULE III WEB SERVICE AND CONTEMPORARY SOA 7 Message Exchange Pattern .WSDL related XML Schema language Basics . MODULE II EVOLUTION OF SOA 7 The evolution of SOA .WS Reliable Messaging language Basics- 74 .Service design and business process design.SOAP Language Basics .Meta data Exchange .WSDL Language Basics . MODULE IV PRINCIPLES OF SERVICE ORIENTATION 8 Principles of service orientation -Building SOA .Orchestration – Choreography – Addressing .Consideration for choosing service layers.Reliable Messaging .Business Activity.

Shankar Kambhampaty.NET. Pearson Education. “Service Oriented Architecture for Enterprise Architecture for Enterprise Application”.NET. OUTCOMES: Students who complete this course will be able to • understand the fundamental and advanced design principles of Service Oriented Architecture. Thomas Erl.SOA Support in J2EE. Network Security WS policy Language Basics . 2. 75 . 2009. Wiley Publication 2008.Case Studies of Rail Co ltd and Oasis Car Wash service.SOA Support in . • build an SOA platform supported by J2EE and .M. 1st Edition.WS Metadata Exchange Language Basics- WS security Language Basics -SOA Platform basics . Concepts. Total Hours: 45 REFERENCES: 1. “Service Oriented Architecture. Technology and design”.Tech.

Choosing a common measure for all associated systems. MODULE I SOFTWARE RELIABILITY 8 Problem.Preparing test procedures-Executing Test . MODULE III TEST CASES 9 Developed software failure intensity objectives. MODULE IV IDENTIFYING 7 Identifying failures .Tech.Defining “failure” for the product .Allocating new test cases.Planning number of new test cases for current release.M. • concentrates on security issues intrinsic to software systems. identifying. .Establishing when failures occurred. Network Security CSBY58 SECURE SOFTWARE SYSTEMS L T P C 3 0 0 3 OBJECTIVES: This course • provides a detailed explanation of common programming errors. .Applying operation profiles Engineering “Just Right” Reliability.Preparing for Test .Analyzing test output for deviations – Determining which deviations are failures .Experience with SRE – SRE process- Defining the product – Testing acquired software – Reliability concepts- Software and hardware reliability. .Problems of software practitioners– Approach through software reliability engineering . and Product .Preparing test cases. reviewing the operation – Concurrence rate – Occurrence probabilities. Guiding Test - 76 .Setting system failure intensity objectives - Determining user needs for reliability and availability.Detailing test cases . common failure intensity objective.Implementing Operational Profiles. . Process. MODULE II SOFTWARE AVAILABILITY 8 Developing.Overall reliability and availability objectives. .Invoking test. crating. • describes how these errors can lead to software systems that are vulnerable to exploitation.Engineering software reliability strategies .Distributing new test cases among new operations .Planning and allocating test time for the current release .

• show the practical problems of specifying.Security state .Core material - Persuading your boss. . Tata McGraw- Hill.Design principles for secure systems . designing. 2.Physical security . MODULE V SECURE SYSTEMS 7 Using UML for Security . John Musa D. • explain the requirements analysis.Model based security engineering with UML . “Secure Systems Development with UML”. • understand professionalism. II .Security analysis - Important security opportMODULEies . 77 .Security critical interaction .more case studies .Extending UML CASE TOOLS with analysis tools . MODULE VI UML 6 Applications . 2010 (unit IV. OUTCOMES: Students who complete this course will be able to • understand the importance of securing software engineering. project management. your coworkers. III). object-oriented design.Applying security patterns .Tech. Jan Jürjens. V. 2008 (unit I. • identify current secure issues in software engineering.Deploying SRE. 2nd Edition. and building large.UML sec profile. 2nd Edition.Formal Foundations .Using failure intensity patterns to guide test .Estimating failure intensity .Developing Secure Java program. Network Security Tracking reliability growth . and the legal framework for software development.Secure channel .Tool support for UML Sec .M.Executing the deployment .Using a consultant. implementation.UML machines - Rely guarantee specifications. Springer. reliable software systems.Analyzing Model .formal semantics . “Software Reliability Engineering”.UM L diagrams for security requirement -Security business process. and stakeholders.reasoning about security properties.Certifying reliability. Total Hours: 45 REFERENCES: 1.Automated tools for UML SEC. VI). testing in software engineering.Notation .

• To introduce the motive and technology of modus operandi motive and technology in digital forensics. MODULE V FORENSICS AND NETWORKS 8 Network basics for Digital Investigators-Applying Forensic science to Networks- Digital Evidence on the internet.Tech. MODULE IV DIGITAL INVESTIGATORS 7 Computer Basics for Digital investigators-Applying Forensics Science to computers-Digital Evidence on Windows System-Digital Evidence on UNIX System-Digital Evidence on Macintosh System. • To understand the role of forensics group. MODULE III DIGITAL EVIDENCE AND CYBER TALKING 7 Violent Crime and Digital Evidence –Digital Evidence as Alibi-Computer Intrusions-Cyber Talking.M. MODULE VI DIGITAL EVIDENCE ON THE INTERNET 7 Digital Evidence on Physical and Data link layers-Digital Evidence on Network and Transport layers. MODULE II DIGITAL CRIME 8 Conducting Digital investigations-Handling a Digital Crime Scene-Investigative reconstruction with Digital Evidence-Modus Operandi motive and technology. Network Security CSBY59 ADVANCED DIGITAL FORENSICS L T P C 3 0 0 3 OBJECTIVES: • To give an overview of the laws involved in cyber crime. Total Hours: 45 78 . • To introduce the design factors in protecting our data form unauthorized intrusions. MODULE I INTRODUCTION 8 Foundations of digital Forensics-Language of Computer Crime Investigation- Digital Evidence in the courtroom-Cybercrime law.

“Real Digital Forensics. 2011. Elsevier 2010. Eoghan Casey. 3rd Edition . OUTCOMES: Students who complete this course will be able to • understand the punishment involved in cyber crime. 3.Published by Elsevier. Addison Wesley Professional.M. network and transport layer. 1st Edition. 5th printing. 79 . data link. “Digital Forensics for Network. Rose. Internet. Lillard. Curtis W. • find the digital evidence involved in the physical. 2. Clint P. Richard Bejtlich. Mit DVD: Computer Security and Incident Response”. Computers and the Internet “. “Digital Evidence and Computer Crime: Forensic Science. and Cloud Computing: A Forensic evidence Guide for Moving Targets and Data”.Tech. Keith John Jones. • protect their computers from unauthorized users in network. 2008. Terrence V. Network Security REFERENCES: 1. Garrison.

Single-Source Shortest Paths Bellman-Ford algorithms. MODULE II SORTING AND SEARCHING 8 Heap sort – Priority Queue – Quick Sort –Performance and analysis of quick sort.M. and analyze their time complexity in a mathematically rigorous manner.Elements of the greedy strategy –Huffman codes – Matroids – Amortized Analysis – Aggregate analysis – The accounting method .An activity-selection problem.Bucket Sort – Binary search.Optimal Binary search trees – Greedy Algorithms. MODULE III ADVANCED DESIGN AND ANALYSIS TECHNIQUES 8 Dynamic Programming–Rod cutting-Matrix-chain multiplication. • Understand the basic idea behind the techniques. so that you are able to develop algorithms for new problems where these techniques can be applied.Potential method. Network Security CSBY60 ADVANCED ALGORITHMS L T P C 3 0 0 3 OBJECTIVES: • Explores the relevance of analysis to the design of efficient computer algorithms. • Understand and apply the algorithms.Sorting in Linear time – Counting sort-Radix Sort.Tech. prove their correctness. MODULE I INTRODUCTION 8 The role of Algorithms in Computing – Getting Started – Analyzing algorithms- Designing Algorithms–Growth of Functions – Divide and conquer – Probabilistic Analysis and Randomized Algorithms.Dijkstra’s algorithm– All-pairs Shortest Paths – Maximum Flow.Depth-first search – Topological sort .Minimum Spanning Trees – The algorithms of Kruskal and Prim . MODULE V NUMBER-THEORETIC ALGORITHMS 7 Elementary number-theoretic notions – Greatest common divisor – Modular arithmetic – Solving modular arithmetic – Solving modular linear equations- 80 . MODULE IV GRAPH ALGORITHMS 7 Elementary Graph Algorithms –Breadth-first search.

“Algorithms”. Michael Soltys. MIT Press. 2. Pearson Education. 3. new research problems.Cormen. Robert Sedgewik. 4th Edition. 2012.Leiserson .M. • look for research resources and later identify (discover). 1999. 2011. Sara Baase. 3rd Edition. Total Hours: 45 REFERENCES: 1. 1st Edition. Charless E. World Scientific. MODULE VI STRING MATCHING AND MAXIMUM FLOW 7 The naïve-matching algorithm – the Rabin-Karp algorithm – String matching with finite automata.” Algorithm Design”. PHI Learning.The RSA public-key cryptosystem – Primality testing – Integer factorization. Thomas H.2010. 2nd Edition. 2006.Introduction to design and analysis.Kevin wayne. Jon Kleinberg. Pearson/Addison- Wesley. 3rd Edition. 6. “Introduction to Algorithms”. Ronald L. 2013. Thomas H. Addison-Wesley. “An Introduction to the Analysis of Algorithm”. as well as formulate.Tech. OUTCOMES: Students who complete this course will be able to • have critical awareness of current problems and research issues in the field of complexity theory and abstract discrete algorithms. 5. 81 .The Knuth-Morris-Pratt algorithm – Flow networks – The Ford-Fulkerson method – Maximum bipartite matching – Push-relabel algorithms. Rivest and Clifford Stein. Eva Tardos. Computer algorithms . Network Security The Chinese remainder theorem. 4.Cormen “Algorithms Unlocked”.

Tech. MODULE II BASIC CRYPTOGRAPHY 8 Basic cryptographic terms: Historical background . availability.Inference control .Database secrecy . MODULE III PROGRAM SECURITY 8 Flaws . deterrence.Confidentiality.Symmetric crypto primitives . • concentrates on security issues intrinsic to software systems.Evaluation criteria .Multilevel databases.Evaluation process .Authentication requirements .Modes of operation . security mechanisms – Assurance - Prevention.Security policies. Program flaws: buffer overflows.Database integrity .Database management systems security .Asymmetric crypto primitives. Network Security CSBY61 HUMAN ASPECTS OF COMPUTER SECURITY L T P C 3 0 0 3 OBJECTIVES: This course • provides a detailed explanation of common programming errors • describes how these errors can lead to software systems that are vulnerable to exploitation. MODULE I THREATS AND SECURITY 8 Basic concepts: threats – Vulnerabilities – Controls – Risk . detection. MODULE V TRUSTED OPERATING SYSTEMS 6 Assurance – trust: Design principles . object protection requirements and techniques .Protection in contemporary operating systems .Software development controls Testing techniques.M.Identification and authentication - Identification goals . file. Trojan horses. worms. incomplete mediation – Defences .Human authentication - Machine authentication. 82 .Cryptographic hash functions . time. MODULE IV AUTHENTICATION 7 Memory. integrity. time-of-check to time-of-use flaws.Malicious code: viruses.

Introduction to network security techniques: firewalls. “Security in Computing”. spoofing.Pfleeger (Consulting Group Pfleeger). designing. Prentice Hall. object-oriented design. Pearson Publication. Network Security MODULE VI NETWORK SECURITY 8 Network threats: eavesdropping. testing in software engineering. Charles P. denial of service attacks . and the legal framework for software development.M. virtual private networks . project management. reliable software systems. • understand professionalism. OUTCOMES: Students who complete this course will be able to • understand the importance of securing software engineering. • explain the requirements analysis.Tech. implementation. William Stallings. 2009. 2011. modification.Security policies - Risk analysis .Management of security . • identify current secure issues in software engineering. 83 . Shari Lawrence( RAND Corporation Pfleeger). 4th Edition. 5th Edition. 2. and building large. “Cryptography and Network security”.Physical threats and controls. • show the practical problems of specifying.Intrusion detection . Total Hours: 45 REFERENCES: 1.

OS commands.Managing the application . HTML forms and thick-client components - Active X controls .Encoding schemes.Buffered overflow attacks .Transmitting data via the Client . • To learn about security attacks and tools available to curtail them.Tech.Weakness in session management generation and handling.Handling user access .Web functionality .Tech (CSE. Network Security CSBY18 HACKING TECHNIQUES AND DIGITAL FORENSICS L T P C (Common to M.Code injection .Handling attackers .Local privacy attacks . Its prevention .Design flaws in authentication .Integer and format string vulnerabilities. Its prevention- Exploiting information disclosure .The HTTP protocol .User input .Frame injection.Session fixation . NS)) 3 0 0 3 OBJECTIVES: • To educate upon the security threats.Exploiting error message. • To understand the different vulnerabilities and modes of preventing them. web scripting techniques.Capturing user data. SMDP. Its prevention .XSS .Advanced exploiting techniques -Its prevention.Defence mechanisms . MODULE III VULNERABILITIES AND PREVENTION 8 Common vulnerabilities.HTTP header injection .Web application technologies .Attacking authentication .JSON hijacking . Its prevention . Its prevention - Attacking compiled application .Redirection attacks .Injection into SQL.Bypassing client side control .Automating bespoke attacks .Attacking access control. MODULE IV SECURITY ATTACKS 8 Burp proxy .Logic flaws . Its prevention .Finding and exploiting path traversal vulnerabilities. LDAP - Attacking path traversal .Fuzzing common vulnerabilities.Attacking other users . MODULE II AUTHENTICATION AND SESSION MANAGEMENT 7 Mapping the application . SOAP.Prevention .Prevention .M.Attacking application logic .Request forgery. MODULE I APPLICATION SECURITY 7 Problem factors .Architectural attacks – Tiered architecture 84 .Attacking session management .Implementation flaws in authentication . XPath.Uses for bespoke automation - Enumerating valid identifier .

Firewall engineering .Input based vulnerabilities.Tech.Kinds of firewalls.Session management mechanism – Access controls .Sharing hosting vulnerabilities.Logic flaws.Kerberos authentication system .Application-level Encryption . Bellovin and Aviel D.Filtering services .Host-to-host authentication .SASl .Vulnerable application configuration and Software .Web server vulnerabilities.Web browsers . • apply suitable tools and techniques for enforcing system security. 2. Total Hours: 45 REFERENCES: 1. Wiley Publications. MODULE V HACKING AND SECURITY 7 Hacker's toolkit .Different languages.Time-based one-time passwords .Hacker's methodology – Mapping application content -Analyzing application-testing . William R.PKI – Firewalls .Hidden markov model. Its prevention . Network Security .Smart cards .Source code vulnerabilities .Rubin.Network level encryption . Dafydd Stuttard and Marcus Pinto.Challenge/ response one-time password .Link level encryption . 2008. MODULE VI TOOLS AND TECHNOLOGIES 8 Security tools and services .Tunneling and VPNs - Secure communications over insecure networks .RADIUS . 2011.M. Its prevention. • analyze a system and detect vulnerabilities and provide solutions to overcome them. "The Web Application Hacker's Handbook: Finding and Exploiting Security Flaws".Shared hosting and Application service providers.Miscellaneous checks.Cheswick. "Firewalls and Internet Security – Repelling the Wily hacker".Client side controls - Authentication mechanism . OUTCOMES: Students who complete this course will be able to • understand the terms and terminologies related to hacking and security. 2nd Edition. Pearson Education. 85 .Integrated testing suites – Vulnerability scanners -Nikto-hydra-custom Scripts .Lamport's one-time password algorithm . 2nd Edition. Steven M.Server attack .

Tech (CSE. 86 . • To learn techniques at each stage of development. NS)) 3 0 0 3 OBJECTIVES: • To study about classical software engineering life cycle model. from analysis through testing. MODULE I SOFTWARE ENGINEERING CONCEPTS 8 Software engineering concepts and development activities –Managing Software development .Requirement Elicitation Concepts – Activities – Negotiating Specifications with Clients – Maintaining Traceability – Documenting Requirements Elicitation.M. MODULE II OBJECT ORIENTATION AND REQUIREMENT 8 Object Orientation Concepts . UML. Network Security CSBY22 OBJECT ORIENTED SOFTWARE ENGINEERING L T P C (Common to M. • To learn basics of the software engineering process life cycle. MODULE V TESTING 7 Testing Concepts – Testing Activities – Managing Testing – Object Oriented Testing Strategies – Challenges and issues. • To discuss the implications of various aspects of software engineering • To investigate principles of object-oriented software engineering.People Capability Maturity Model Overview of UML – Modelling Concepts – A deeper view into UML. MODULE III TEAM ORGANIZATION AND MODELLING WITH UML 7 Team Organization – Approaches – Choosing an appropriate Team Organization.Tech.Software life cycle models – Iteration and Incrementation – Other life cycle models – Comparison of life cycle models.Coupling. MODULE IV ANALYSIS AND DESIGN 8 Overview of Analysis – Concepts – Activities – Managing Analysis – Design Concepts -From Modules to Objects .Cohesion. including use cases.

OUTCOMES: Students who complete this course will be able to • understand the basic concepts of software development life cycle. and Java”. Prentice Hall. “Object-Oriented Software Engineering Using UML. Patterns. Network Security MODULE VI MANAGING CHANGE AND CONFIGURATION 7 Rationale Management – Concepts – Activities – Documenting Rationale – Overview of Configuration Management. 2010. Bernd Bruegge & Allen H. Robert Laganiere. 2004.M. Total Hours: 45 REFERENCES: 1.”. 2004. 3rd Edition. 3.”Object-Oriented Software Engineering – Practical Software Development Using UML and Java. 8th Edition. Craig Larman “Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development”. Stephen R. Mc Graw Hill Education. 87 . 3rd Edition.Schach “Object Oriented and Classical Software Engineering”. 4. 2010. Timothy C. 2. Lethbridge. • explore the different UML diagrams and tools for the same. 2nd Edition. Dutoit. Prentice Hall.Tech. Mc-Graw Hill education. • understand the different design and testing concepts • build successful teams for projects.

Network Security CSBY25 CLOUD COMPUTING L T P C (Common to M. Security.Tech (CSE .Broadband Networks and Internet Architecture . CLUSTERING AND VIRTUALIZATION 8 Scalable Computing Service over The Internet .Virtualization Structures/Tools and Mechanisms .Dynamic Scalability Architecture .Goals and Benefits .NS.Elastic 88 . MODULE III CLOUD FUNDAMENTALS 7 Origins and Influences .Basic Concepts and Terminology .CPA)) 3 0 0 3 OBJECTIVES: • This course provides a comprehensive and in-depth knowledge of Cloud Computing concepts.Tech. Memory and I/O Devices .Virtualization of CPU. while providing sufficient foundations to enable further study and research.Workload Distribution Architecture - Resource Pooling Architecture .Virtual Clusters and Resource Management .Design Principles of Computer Clusters - Cluster Job and Resource Management.Computer Clusters and MPP Architectures . MODULE II VIRTUALIZATION 7 Implementation Levels of Virtualization .Cloud Characteristics - Cloud Delivery Models .SE. technologies.Technologies for Network- based Computing .Service Technology. • to expose the students to frontier areas of Cloud Computing and information systems. architecture and applications by introducing and researching state-of-the-art in Cloud Computing fundamental issues. technologies.Cloud Deployment Models.Risks and Challenges . MODULE I SYSTEMS MODELING. MODULE IV CLOUD COMPUTING ARCHITECTURE 8 Fundamental Cloud Architectures .Performance.Virtualization for Datacenter Automation.M.System Models for Distributed and Cloud Computing - Software Environments for Distributed Systems and Clouds .Roles and Boundaries .Virtualization Technology .Web Technology - Multitenant Technology .Clustering for Massive Parallelism . and Energy-Efficiency . applications and implementations.

“Cloud Computing: Concepts. 1st Edition. • identify the architecture and infrastructure of cloud computing.Cloud Delivery Models: The Cloud Consumer . 2011. 2009. and interoperability.M. Morgan Kaufmann. Thomas Erl.Storage Workload Management Architecture.Cost Management Considerations. 2013. Ricardo Puttini. 1st Edition. Zaigham Mahmood. Kai Hwang.Cloud Balancing Architecture -Resource Reservation Architecture . • explain the core issues of cloud computing such as privacy.Redundant Storage Architecture. hybrid cloud. Pearson. Prentice Hall/ Pearson PTR. PaaS. strengths.Cloud Usage Cost Metrics . Total Hours: 45 REFERENCES: 1. IaaS. Technology & Architecture”. key technologies. private cloud. 89 . public cloud. and limitations of cloud computing and the possible applications for state-of-the-art cloud computing. “Cloud computing”. Jack Dongarra & Geoffrey Fox.Elastic Disk Provisioning Architecture . 2. 3.Cost Metrics and Pricing Models . MODULE VI WORKING WITH CLOUDS 7 Cloud Delivery Models: The Cloud Provider Perspective . Micheal Miller.Zero Downtime Architecture . OUTCOMES: Students who complete this course will be able to • articulate the main concepts. MODULE V ADVANCED CLOUD ARCHITECTURES 8 Hypervisor Clustering Architecture . Network Security Resource Capacity Architecture -Service Load Balancing Architecture . including SaaS.Non-Disruptive Service Relocation Architecture .Cloud Bursting Architecture .Rapid Provisioning Architecture .Tech.Business Cost Metrics . 1st Edition.Load Balanced Virtual Server Instances Architecture . etc.Dynamic Failure Detection and Recovery Architecture -Bare-Metal Provisioning Architecture . “Distributed and Cloud Computing”.

analyze. • identify problems. and explain. and approaches for the related issues.M. algorithms. and evaluate various cloud computing solutions. • provide the appropriate cloud computing solutions and recommendations according to the applications used. 90 .Tech. Network Security • choose the appropriate technologies.