KTU 2024 Scheme · Semester 4 · Program Elective I — Information Technology
Foundations of Security (PEITT413) Syllabus
Official KTU 2024 Scheme syllabus for Foundations of Security, Semester 4, Program Elective I — Information Technology (Information Technology).
Course Code
PEITT413
Credits
3
Teaching Hours
3:0:0:0 (L:T:P:R)
CIE Marks
40
ESE Marks
60
Exam Duration
2 Hrs. 30 Min.
Prerequisites
PCITT205: Discrete Mathematical Structures
Semester
Semester 4
Course Objective
To build a robust understanding of essential mathematical concepts and apply these theories to understand and develop traditional and modern cryptographic techniques, including substitution techniques, stream and block ciphers, and secret key ciphers. To solve complex mathematical problems related to number theory and algebraic structures, and apply these solutions to practical cryptographic scenarios.
Module-wise Syllabus
Module 1
9 contact hoursDivisibility and Modular Arithmetic: Finite Fields - Groups, Rings and Fields. Divisibility - Divisibility and Division Algorithms, Well ordering Principle, Bezout's Identity. Modular Arithmetic- Properties, Euclidean algorithm for the greatest common divisor, Extended Euclidean Algorithm, Least Common multiple, Modular Division.
Module 2
9 contact hoursPrimes and Congruences: Prime Numbers - Prime Numbers and prime- power factorization, Fermat and Mersenne primes, Primality testing and factorization. Congruences - Linear congruences, Chinese Remainder Theorem, 2*2 Linear Systems, Fermat's little theorem, Pseudoprimes and Carmichael numbers.
Module 3
9 contact hoursEuler's Function & Quadratic Residues: Euler's Function - Euler's Totient function, Applications of Euler's Totient function, Quadratic Residues- Quadratic Congruences, The group of Quadratic residues, Legendre symbol, Jacobi Symbol, Quadratic reciprocity. Sum of Squares and Continued Fractions: Sum of Squares - Sum of two squares, The Gaussian Integers, Sum of three squares, Sum of four squares. Continued Fractions - Finite continued fractions, Infinite continued fractions.
Module 4
9 contact hoursTraditional and Modern Cryptosystems: Substitution Techniques, Monoalphabetic Cipher, Caesar Cipher, Affine Cipher, Polyalphabetic Ciphers, Autokey Cipher, Playfair Cipher, Hill Cipher, Vigenere Cipher, One Time Pad Cipher, Limitations. Stream and Block Ciphers, Modern Secret Key Ciphers - Substitution Box-Permutation Box-Product Ciphers.
Course Outcomes
- CO1Understand the fundamental concepts of divisibility, modular arithmetic, and finite fields, and apply these concepts to solve mathematical problems.
- CO2Solve problems related to prime numbers, congruences, and primality testing, including the application of the Chinese Remainder Theorem and Fermat's Little Theorem.
- CO3Apply Euler's Totient function, quadratic residues, and concepts of the group of units in various mathematical and cryptographic contexts.
- CO4Solve complex problems involving the sum of squares, continued fractions, and traditional cryptosystems, and assess the effectiveness of various cryptographic algorithms and techniques.
Assessment Pattern (CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation (CIE)
| Attendance | 5 |
| Assignment / Microproject | 15 |
| Internal Examination 1 (Written) | 10 |
| Internal Examination 2 (Written) | 10 |
End Semester Examination (ESE)
Total 60 marks, 2 Hrs. 30 Min.. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.
Textbooks & Reference Books
Textbooks
- Elementary Number Theory with Applications — Thomas Koshy (Elsevier Science, 2nd Edition 2007)
- Elementary Number Theory — G.A. Jones & J.M. Jones, (Springer UTM, 2007)
- A Friendly introduction to Number Theory — Joseph Silverman (Pearson Ed, 2009)
Reference Books
- A Course in Number Theory and Cryptography — Neal Koblitz (Springer New York, 2012)
- Cryptography and Network Security: Principles and Practice" by — William Stalling (Pearson Education, 4th Edition 2016)
- Introduction to Analytic Number Theory' — Tom M. Apostol (Narosa Publishing House Pvt. Ltd, New Delhi, 1996)
Frequently Asked Questions
How many credits is KTU Foundations of Security (PEITT413)?
3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.
How many modules are in the PEITT413 syllabus?
4 modules, 36 total contact hours.
What is the CIE and ESE mark split for this course?
CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs. 30 Min.. Total: 100 marks.
What are the recommended textbooks for PEITT413?
Elementary Number Theory with Applications (Thomas Koshy); Elementary Number Theory (G.A. Jones & J.M. Jones,); A Friendly introduction to Number Theory (Joseph Silverman).
Is this syllabus specific to one branch, or common to others too?
This Semester 4 course is listed under Program Elective I — Information Technology at KTU under the 2024 Scheme — check the course header above for which branches it's common to.
Need help with KTU Foundations of Security?
Learnizo offers live, 1-on-1 online tuition for KTU IT subjects — matched to your exact module and semester.