About the course and scheme CST 393 Cryptographic Algorithms

 CST 393 CRYPTOGRAPHIC ALGORITHMS 

Category L     T     P     Credit     Year of Introduction

VAC         3     1     0     4                 2019


Preamble:

The course on Cryptographic Algorithms aims at exploring various algorithms deployed in offering confidentiality, integrity, authentication and non-repudiation services. This course covers classical encryption techniques, symmetric and public key crypto-system, key exchange and management, and authentication functions. The concepts covered in this course enable the learners in effective use of cryptographic algorithms for real life applications.

Prerequisite: A sound background in Number Theory.

Course Outcomes: After the completion of the course the student will be able to
CO1 Identify the security services provided for different types of security attacks.
(Cognitive Knowledge Level : Understand)
CO2 Summarize the classical encryption techniques for information hiding. 
(Cognitive Knowledge Level: Apply)
CO3 Illustrate symmetric / asymmetric key cryptographic algorithms for secure
communication.(Cognitive Knowledge Level: Apply)
CO4 Interpret key management techniques for secure communication.
(Cognitive Knowledge Level: Understand)
CO5 Summarize message authentication functions in a secure communication scenario.
(Cognitive Knowledge Level: Understand)

Assessment Pattern   
    Bloom’s
Category                    Continuous Assessment Tests   End Sem Exam
                                        Test 1           Test2  

Remember                        30               30                       30
Understand                       30               30                       30
Apply                                30              30                       30

Mark Distribution
Total
Marks    CIE Marks          ESE Marks         ESE Duration
150             50                         100                     3 hours

Continuous Internal Evaluation Pattern:
Attendance : 10 marks
Continuous Assessment Tests : 25 marks
Continuous Assessment Assignment : 15 marks

Internal Examination Pattern:
Each of the two internal examinations has to be conducted out of 50 marks. First Internal Examination shall be preferably conducted after completing the first half of the syllabus and the Second Internal Examination shall be preferably conducted after completing remaining part of the syllabus.

There will be two parts: Part A and Part B. Part A contains 5 questions (preferably, 2 questions each from the completed modules and 1 question from the partly covered module), having 3 marks for each question adding up to 15 marks for part A. Students should answer all questions from Part A. Part B contains 7 questions (preferably, 3 questions each from the completed modules and 1 question from the partly covered module), each with 7 marks. Out of the 7 questions in Part B, a student should answer any 5.

End Semester Examination Pattern:
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students should answer all questions. Part B contains 2 questions from each module of which a student should answer any one. Each question can have maximum 2 sub-divisions and carries 14 marks.


Comments

Popular posts from this blog

Cryptographic Algorithms CST 393 KTU CS Honour Notes Semester V -Dr Binu V P

Syllabus CST 393 Cryptographic Algorithms

Computer Security Concept- CIA Triad